./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11ddcf89253f51aa3cb067e43e3bbb571fb8d869223176d4f3227e1dc0d91892
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:20:32,043 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:20:32,084 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 05:20:32,087 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:20:32,088 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:20:32,104 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:20:32,105 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:20:32,105 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:20:32,105 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:20:32,106 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:20:32,106 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:20:32,106 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:20:32,107 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:20:32,107 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:20:32,107 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:20:32,108 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:20:32,108 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:20:32,108 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:20:32,108 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:20:32,109 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:20:32,109 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:20:32,110 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:20:32,110 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:20:32,110 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:20:32,110 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:20:32,111 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:20:32,111 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:20:32,111 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:20:32,111 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:20:32,112 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:20:32,112 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:20:32,112 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:20:32,112 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:20:32,112 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:20:32,113 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:20:32,114 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:20:32,114 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11ddcf89253f51aa3cb067e43e3bbb571fb8d869223176d4f3227e1dc0d91892
[2024-03-09 05:20:32,288 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:20:32,317 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:20:32,320 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:20:32,321 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:20:32,321 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:20:32,322 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i
[2024-03-09 05:20:33,464 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:20:33,642 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:20:33,643 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i
[2024-03-09 05:20:33,654 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/d8269394d/ca9f4b6c39b74e4389c559da5d0bb4b9/FLAGf0d092550
[2024-03-09 05:20:33,664 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/d8269394d/ca9f4b6c39b74e4389c559da5d0bb4b9
[2024-03-09 05:20:33,666 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:20:33,667 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:20:33,668 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:20:33,668 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:20:33,672 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:20:33,672 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:20:33" (1/1) ...
[2024-03-09 05:20:33,673 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b552ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:33, skipping insertion in model container
[2024-03-09 05:20:33,673 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:20:33" (1/1) ...
[2024-03-09 05:20:33,704 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:20:33,976 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:20:33,983 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:20:34,017 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:20:34,050 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:20:34,050 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34 WrapperNode
[2024-03-09 05:20:34,050 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:20:34,051 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:20:34,051 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:20:34,051 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:20:34,056 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,070 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,089 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-09 05:20:34,090 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:20:34,090 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:20:34,090 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:20:34,090 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:20:34,097 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,097 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,100 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,100 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,108 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,110 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,112 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,113 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,115 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:20:34,115 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:20:34,115 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:20:34,116 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:20:34,116 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (1/1) ...
[2024-03-09 05:20:34,120 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:20:34,129 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:20:34,140 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 05:20:34,148 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:20:34,184 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:20:34,185 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:20:34,185 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:20:34,185 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:20:34,185 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:20:34,186 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 05:20:34,325 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:20:34,326 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:20:34,531 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:20:34,540 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:20:34,540 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:20:34,541 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:20:34 BoogieIcfgContainer
[2024-03-09 05:20:34,541 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:20:34,543 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:20:34,543 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:20:34,545 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:20:34,545 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:20:33" (1/3) ...
[2024-03-09 05:20:34,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcdb92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:20:34, skipping insertion in model container
[2024-03-09 05:20:34,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:20:34" (2/3) ...
[2024-03-09 05:20:34,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcdb92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:20:34, skipping insertion in model container
[2024-03-09 05:20:34,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:20:34" (3/3) ...
[2024-03-09 05:20:34,547 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr-race.i
[2024-03-09 05:20:34,553 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:20:34,560 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:20:34,560 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-09 05:20:34,560 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:20:34,602 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:20:34,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:20:34,683 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-03-09 05:20:34,683 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:20:34,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. 
[2024-03-09 05:20:34,687 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:20:34,691 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-03-09 05:20:34,698 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:20:34,703 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e125092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:20:34,703 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 05:20:34,711 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:20:34,711 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:20:34,711 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:20:34,711 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:34,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:34,712 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:34,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:34,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -1959977170, now seen corresponding path program 1 times
[2024-03-09 05:20:34,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:34,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63187543]
[2024-03-09 05:20:34,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:34,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:34,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:35,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:35,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:35,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63187543]
[2024-03-09 05:20:35,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63187543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:35,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:35,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:35,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673652659]
[2024-03-09 05:20:35,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:35,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:35,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:35,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:35,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:35,569 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-03-09 05:20:35,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:35,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-03-09 05:20:35,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:35,697 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-03-09 05:20:35,697 INFO  L125   PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES.
[2024-03-09 05:20:35,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2315 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. 
[2024-03-09 05:20:35,701 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-03-09 05:20:35,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-03-09 05:20:35,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:35,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:35,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:20:35,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:20:35,714 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:20:35,714 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:20:35,716 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:35,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:20:35,724 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,729 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,729 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,730 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:20:35,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-03-09 05:20:35,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:20:35,737 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-03-09 05:20:35,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142}
[2024-03-09 05:20:35,742 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-09 05:20:35,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-03-09 05:20:35,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,742 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:35,743 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:35,743 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:20:35,743 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:35,744 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:35,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -1181633295, now seen corresponding path program 1 times
[2024-03-09 05:20:35,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:35,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443918961]
[2024-03-09 05:20:35,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:35,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:35,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:35,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:35,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:35,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443918961]
[2024-03-09 05:20:35,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443918961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:35,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:35,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:35,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272758261]
[2024-03-09 05:20:35,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:35,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:20:35,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:35,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:20:35,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:20:35,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-03-09 05:20:35,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:35,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-03-09 05:20:35,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:35,957 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-03-09 05:20:35,957 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-03-09 05:20:35,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2140 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. 
[2024-03-09 05:20:35,960 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-03-09 05:20:35,960 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-03-09 05:20:35,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:35,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:35,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-03-09 05:20:35,962 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-03-09 05:20:35,962 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-03-09 05:20:35,962 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-03-09 05:20:35,963 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:35,963 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-03-09 05:20:35,964 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,965 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,966 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,966 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-03-09 05:20:35,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-03-09 05:20:35,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:20:35,971 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-03-09 05:20:35,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146}
[2024-03-09 05:20:35,972 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-09 05:20:35,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-03-09 05:20:35,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:35,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:35,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:35,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:20:35,973 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:35,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:35,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309427349, now seen corresponding path program 1 times
[2024-03-09 05:20:35,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:35,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205712655]
[2024-03-09 05:20:35,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:35,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:35,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:36,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:36,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:36,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205712655]
[2024-03-09 05:20:36,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205712655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:36,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:36,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:36,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220271348]
[2024-03-09 05:20:36,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:36,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:36,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:36,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:36,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:36,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-03-09 05:20:36,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:36,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:36,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-03-09 05:20:36,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:36,626 INFO  L124   PetriNetUnfolderBase]: 207/964 cut-off events.
[2024-03-09 05:20:36,627 INFO  L125   PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES.
[2024-03-09 05:20:36,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5981 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. 
[2024-03-09 05:20:36,633 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-03-09 05:20:36,633 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-03-09 05:20:36,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:36,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:36,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-03-09 05:20:36,635 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-03-09 05:20:36,635 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-03-09 05:20:36,635 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-03-09 05:20:36,636 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:36,636 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-03-09 05:20:36,637 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:36,639 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:36,640 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:36,640 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-03-09 05:20:36,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-03-09 05:20:36,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:20:36,646 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-03-09 05:20:36,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192}
[2024-03-09 05:20:36,647 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-03-09 05:20:36,647 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-03-09 05:20:36,648 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:36,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:36,648 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:36,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:20:36,648 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:36,649 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:36,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 892950531, now seen corresponding path program 1 times
[2024-03-09 05:20:36,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:36,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076017791]
[2024-03-09 05:20:36,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:36,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:36,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:36,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:36,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:36,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076017791]
[2024-03-09 05:20:36,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076017791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:36,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:36,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:36,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123976709]
[2024-03-09 05:20:36,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:36,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:36,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:36,916 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:36,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:37,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-03-09 05:20:37,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:37,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:37,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-03-09 05:20:37,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:37,469 INFO  L124   PetriNetUnfolderBase]: 589/1947 cut-off events.
[2024-03-09 05:20:37,469 INFO  L125   PetriNetUnfolderBase]: For 1481/1602 co-relation queries the response was YES.
[2024-03-09 05:20:37,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 1947 events. 589/1947 cut-off events. For 1481/1602 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14403 event pairs, 94 based on Foata normal form. 19/1861 useless extension candidates. Maximal degree in co-relation 4914. Up to 1020 conditions per place. 
[2024-03-09 05:20:37,479 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 120 changer transitions 6/314 dead transitions.
[2024-03-09 05:20:37,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:20:37,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:37,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:37,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:20:37,482 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:20:37,482 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:20:37,482 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:20:37,482 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:37,482 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:20:37,484 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:37,485 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:37,485 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:37,485 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:20:37,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:20:37,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 05:20:37,498 INFO  L231             Difference]: Finished difference. Result has 151 places, 308 transitions, 2003 flow
[2024-03-09 05:20:37,499 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2003, PETRI_PLACES=151, PETRI_TRANSITIONS=308}
[2024-03-09 05:20:37,499 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-03-09 05:20:37,499 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 308 transitions, 2003 flow
[2024-03-09 05:20:37,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:37,500 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:37,500 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:37,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:20:37,500 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:37,501 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:37,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455306383, now seen corresponding path program 1 times
[2024-03-09 05:20:37,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:37,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080604304]
[2024-03-09 05:20:37,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:37,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:37,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:37,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:37,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:37,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080604304]
[2024-03-09 05:20:37,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080604304] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:20:37,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847700244]
[2024-03-09 05:20:37,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:37,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:20:37,964 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:20:37,965 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:20:37,970 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 05:20:38,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:38,088 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-03-09 05:20:38,097 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:20:38,232 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:20:38,270 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:20:38,271 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 05:20:38,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2024-03-09 05:20:38,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:20:38,691 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:20:38,731 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:20:38,780 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:20:39,069 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-03-09 05:20:39,113 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:20:39,113 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:20:39,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:39,148 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:20:39,184 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-09 05:20:39,719 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:20:39,720 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41
[2024-03-09 05:20:39,728 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:20:39,729 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 28
[2024-03-09 05:20:39,744 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 05:20:39,745 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 1
[2024-03-09 05:20:39,756 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 05:20:39,756 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1
[2024-03-09 05:20:40,053 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:20:40,057 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:20:40,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 05:20:40,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847700244] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:20:40,113 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:20:40,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46
[2024-03-09 05:20:40,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068874049]
[2024-03-09 05:20:40,114 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:20:40,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2024-03-09 05:20:40,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:40,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2024-03-09 05:20:40,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1841, Unknown=7, NotChecked=88, Total=2162
[2024-03-09 05:20:40,531 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 31 out of 122
[2024-03-09 05:20:40,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 308 transitions, 2003 flow. Second operand  has 47 states, 47 states have (on average 33.702127659574465) internal successors, (1584), 47 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:40,533 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:40,533 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 122
[2024-03-09 05:20:40,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:47,579 INFO  L124   PetriNetUnfolderBase]: 1369/3443 cut-off events.
[2024-03-09 05:20:47,579 INFO  L125   PetriNetUnfolderBase]: For 5126/5128 co-relation queries the response was YES.
[2024-03-09 05:20:47,586 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12002 conditions, 3443 events. 1369/3443 cut-off events. For 5126/5128 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 24492 event pairs, 95 based on Foata normal form. 67/3465 useless extension candidates. Maximal degree in co-relation 11703. Up to 1115 conditions per place. 
[2024-03-09 05:20:47,597 INFO  L140   encePairwiseOnDemand]: 74/122 looper letters, 507 selfloop transitions, 269 changer transitions 75/883 dead transitions.
[2024-03-09 05:20:47,598 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 883 transitions, 6755 flow
[2024-03-09 05:20:47,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. 
[2024-03-09 05:20:47,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2024-03-09 05:20:47,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 2710 transitions.
[2024-03-09 05:20:47,606 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.32666345226615234
[2024-03-09 05:20:47,606 INFO  L72            ComplementDD]: Start complementDD. Operand 68 states and 2710 transitions.
[2024-03-09 05:20:47,606 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 68 states and 2710 transitions.
[2024-03-09 05:20:47,607 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:47,607 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 2710 transitions.
[2024-03-09 05:20:47,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 69 states, 68 states have (on average 39.85294117647059) internal successors, (2710), 68 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:47,620 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 69 states, 69 states have (on average 122.0) internal successors, (8418), 69 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:47,621 INFO  L81            ComplementDD]: Finished complementDD. Result  has 69 states, 69 states have (on average 122.0) internal successors, (8418), 69 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:47,622 INFO  L175             Difference]: Start difference. First operand has 151 places, 308 transitions, 2003 flow. Second operand 68 states and 2710 transitions.
[2024-03-09 05:20:47,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 883 transitions, 6755 flow
[2024-03-09 05:20:47,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 883 transitions, 6665 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:20:47,657 INFO  L231             Difference]: Finished difference. Result has 243 places, 469 transitions, 3984 flow
[2024-03-09 05:20:47,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=3984, PETRI_PLACES=243, PETRI_TRANSITIONS=469}
[2024-03-09 05:20:47,658 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 122 predicate places.
[2024-03-09 05:20:47,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 469 transitions, 3984 flow
[2024-03-09 05:20:47,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 33.702127659574465) internal successors, (1584), 47 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:47,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:47,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:47,667 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 05:20:47,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:20:47,860 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:47,861 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:47,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 978018084, now seen corresponding path program 1 times
[2024-03-09 05:20:47,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:47,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487177563]
[2024-03-09 05:20:47,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:47,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:47,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:48,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:48,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:48,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487177563]
[2024-03-09 05:20:48,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487177563] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:20:48,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423765214]
[2024-03-09 05:20:48,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:48,337 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:20:48,337 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:20:48,338 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:20:48,341 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 05:20:48,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:48,464 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-09 05:20:48,467 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:20:48,473 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:20:48,506 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:20:48,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 05:20:48,548 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2024-03-09 05:20:48,690 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:20:48,720 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:20:48,754 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:20:48,801 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:20:48,841 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:20:48,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:48,868 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:20:48,885 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false
[2024-03-09 05:20:49,010 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))) is different from false
[2024-03-09 05:20:49,103 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:20:49,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:20:49,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423765214] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:20:49,121 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:20:49,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-09 05:20:49,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310558664]
[2024-03-09 05:20:49,121 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:20:49,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 05:20:49,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:49,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 05:20:49,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=642, Unknown=11, NotChecked=106, Total=870
[2024-03-09 05:20:49,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-03-09 05:20:49,302 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 469 transitions, 3984 flow. Second operand  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:49,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:49,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-03-09 05:20:49,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:50,788 INFO  L124   PetriNetUnfolderBase]: 1075/2953 cut-off events.
[2024-03-09 05:20:50,788 INFO  L125   PetriNetUnfolderBase]: For 12209/12216 co-relation queries the response was YES.
[2024-03-09 05:20:50,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 2953 events. 1075/2953 cut-off events. For 12209/12216 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 21503 event pairs, 207 based on Foata normal form. 31/2924 useless extension candidates. Maximal degree in co-relation 12661. Up to 1430 conditions per place. 
[2024-03-09 05:20:50,809 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 398 selfloop transitions, 35 changer transitions 44/576 dead transitions.
[2024-03-09 05:20:50,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 576 transitions, 5538 flow
[2024-03-09 05:20:50,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 05:20:50,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 05:20:50,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-03-09 05:20:50,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-03-09 05:20:50,812 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-03-09 05:20:50,812 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-03-09 05:20:50,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:50,813 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-03-09 05:20:50,815 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:50,817 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:50,817 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:50,817 INFO  L175             Difference]: Start difference. First operand has 243 places, 469 transitions, 3984 flow. Second operand 18 states and 1088 transitions.
[2024-03-09 05:20:50,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 576 transitions, 5538 flow
[2024-03-09 05:20:50,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 576 transitions, 5325 flow, removed 63 selfloop flow, removed 20 redundant places.
[2024-03-09 05:20:50,922 INFO  L231             Difference]: Finished difference. Result has 235 places, 437 transitions, 3501 flow
[2024-03-09 05:20:50,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3779, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3501, PETRI_PLACES=235, PETRI_TRANSITIONS=437}
[2024-03-09 05:20:50,923 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 114 predicate places.
[2024-03-09 05:20:50,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 437 transitions, 3501 flow
[2024-03-09 05:20:50,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:50,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:50,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:50,929 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 05:20:51,129 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-03-09 05:20:51,134 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:51,134 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:51,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004989113, now seen corresponding path program 1 times
[2024-03-09 05:20:51,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:51,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494517425]
[2024-03-09 05:20:51,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:51,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:51,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:51,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 05:20:51,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:51,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494517425]
[2024-03-09 05:20:51,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494517425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:51,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:51,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:51,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845176326]
[2024-03-09 05:20:51,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:51,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:51,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:51,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:51,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:51,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-03-09 05:20:51,721 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 437 transitions, 3501 flow. Second operand  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:51,721 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:51,721 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-03-09 05:20:51,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:52,033 INFO  L124   PetriNetUnfolderBase]: 613/2198 cut-off events.
[2024-03-09 05:20:52,033 INFO  L125   PetriNetUnfolderBase]: For 7675/7725 co-relation queries the response was YES.
[2024-03-09 05:20:52,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8474 conditions, 2198 events. 613/2198 cut-off events. For 7675/7725 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16986 event pairs, 44 based on Foata normal form. 2/2165 useless extension candidates. Maximal degree in co-relation 8296. Up to 506 conditions per place. 
[2024-03-09 05:20:52,087 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 134 selfloop transitions, 37 changer transitions 18/477 dead transitions.
[2024-03-09 05:20:52,088 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 477 transitions, 4293 flow
[2024-03-09 05:20:52,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:52,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:52,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-03-09 05:20:52,106 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-03-09 05:20:52,106 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-03-09 05:20:52,106 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-03-09 05:20:52,106 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:52,106 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-03-09 05:20:52,107 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:52,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:52,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:52,109 INFO  L175             Difference]: Start difference. First operand has 235 places, 437 transitions, 3501 flow. Second operand 6 states and 642 transitions.
[2024-03-09 05:20:52,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 477 transitions, 4293 flow
[2024-03-09 05:20:52,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 477 transitions, 4206 flow, removed 10 selfloop flow, removed 17 redundant places.
[2024-03-09 05:20:52,150 INFO  L231             Difference]: Finished difference. Result has 227 places, 459 transitions, 3902 flow
[2024-03-09 05:20:52,151 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3902, PETRI_PLACES=227, PETRI_TRANSITIONS=459}
[2024-03-09 05:20:52,151 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 106 predicate places.
[2024-03-09 05:20:52,151 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 459 transitions, 3902 flow
[2024-03-09 05:20:52,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:52,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:52,152 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:52,152 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:20:52,152 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 05:20:52,152 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:52,152 INFO  L85        PathProgramCache]: Analyzing trace with hash 218317082, now seen corresponding path program 1 times
[2024-03-09 05:20:52,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:52,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597081221]
[2024-03-09 05:20:52,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:52,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:52,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:20:52,178 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:20:52,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:20:52,210 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:20:52,211 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:20:52,211 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 05:20:52,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 05:20:52,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 05:20:52,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 05:20:52,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:20:52,214 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:52,216 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:20:52,216 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:20:52,231 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:20:52,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:20:52,251 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-03-09 05:20:52,251 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 05:20:52,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 756 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. 
[2024-03-09 05:20:52,252 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:20:52,253 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-03-09 05:20:52,254 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:20:52,254 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e125092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:20:52,254 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 05:20:52,256 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:20:52,257 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:20:52,257 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:20:52,257 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:52,257 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:52,257 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:20:52,257 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:52,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -322910802, now seen corresponding path program 1 times
[2024-03-09 05:20:52,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:52,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832400529]
[2024-03-09 05:20:52,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:52,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:52,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:52,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:52,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:52,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832400529]
[2024-03-09 05:20:52,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832400529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:52,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:52,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:52,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564757477]
[2024-03-09 05:20:52,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:52,377 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:52,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:52,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:52,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:52,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-03-09 05:20:52,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:52,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:52,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-03-09 05:20:52,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:53,122 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-03-09 05:20:53,122 INFO  L125   PetriNetUnfolderBase]: For 132/220 co-relation queries the response was YES.
[2024-03-09 05:20:53,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 132/220 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31865 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. 
[2024-03-09 05:20:53,139 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-03-09 05:20:53,139 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-03-09 05:20:53,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:53,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:53,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-03-09 05:20:53,144 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-03-09 05:20:53,144 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-03-09 05:20:53,144 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-03-09 05:20:53,144 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:53,144 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-03-09 05:20:53,145 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,146 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,146 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,147 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-03-09 05:20:53,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-03-09 05:20:53,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:20:53,150 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-03-09 05:20:53,151 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179}
[2024-03-09 05:20:53,152 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-03-09 05:20:53,152 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-03-09 05:20:53,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:53,152 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:53,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:20:53,153 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:20:53,153 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:53,153 INFO  L85        PathProgramCache]: Analyzing trace with hash -690971267, now seen corresponding path program 1 times
[2024-03-09 05:20:53,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:53,154 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834519056]
[2024-03-09 05:20:53,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:53,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:53,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:53,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:53,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:53,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834519056]
[2024-03-09 05:20:53,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834519056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:53,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:53,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:53,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704496759]
[2024-03-09 05:20:53,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:53,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:20:53,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:53,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:20:53,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:20:53,246 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-09 05:20:53,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:53,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-09 05:20:53,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:53,513 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-03-09 05:20:53,513 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-03-09 05:20:53,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28451 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. 
[2024-03-09 05:20:53,530 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-03-09 05:20:53,530 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-03-09 05:20:53,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:53,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:53,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-09 05:20:53,532 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-03-09 05:20:53,532 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-09 05:20:53,532 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-09 05:20:53,532 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:53,532 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-09 05:20:53,533 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,534 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,534 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,534 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-03-09 05:20:53,534 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-03-09 05:20:53,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:20:53,539 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-03-09 05:20:53,539 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184}
[2024-03-09 05:20:53,540 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-03-09 05:20:53,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-03-09 05:20:53,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,540 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:53,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:53,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:20:53,541 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:20:53,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:53,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1016193771, now seen corresponding path program 1 times
[2024-03-09 05:20:53,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:53,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183285750]
[2024-03-09 05:20:53,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:53,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:53,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:53,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:53,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:53,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183285750]
[2024-03-09 05:20:53,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183285750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:53,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:53,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:53,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368068437]
[2024-03-09 05:20:53,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:53,657 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:53,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:53,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:53,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:53,871 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-03-09 05:20:53,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:53,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:53,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-03-09 05:20:53,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:54,844 INFO  L124   PetriNetUnfolderBase]: 3173/8712 cut-off events.
[2024-03-09 05:20:54,844 INFO  L125   PetriNetUnfolderBase]: For 4361/4372 co-relation queries the response was YES.
[2024-03-09 05:20:54,859 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 8712 events. 3173/8712 cut-off events. For 4361/4372 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76078 event pairs, 410 based on Foata normal form. 7/8207 useless extension candidates. Maximal degree in co-relation 19323. Up to 3775 conditions per place. 
[2024-03-09 05:20:54,884 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-03-09 05:20:54,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:20:54,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:54,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:54,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-03-09 05:20:54,886 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-03-09 05:20:54,886 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-03-09 05:20:54,886 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-03-09 05:20:54,887 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:54,887 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-03-09 05:20:54,888 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:54,889 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:54,889 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:54,889 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-03-09 05:20:54,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:20:54,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:20:54,899 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:20:54,899 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284}
[2024-03-09 05:20:54,900 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-03-09 05:20:54,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:20:54,900 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:54,900 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:54,900 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:54,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:20:54,901 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:20:54,901 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:54,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 821111039, now seen corresponding path program 1 times
[2024-03-09 05:20:54,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:54,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156714191]
[2024-03-09 05:20:54,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:54,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:54,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:55,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:55,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:55,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156714191]
[2024-03-09 05:20:55,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156714191] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:20:55,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:20:55,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:20:55,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823387408]
[2024-03-09 05:20:55,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:20:55,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:20:55,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:55,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:20:55,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:20:55,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-03-09 05:20:55,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:55,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:55,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-03-09 05:20:55,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:20:57,692 INFO  L124   PetriNetUnfolderBase]: 8683/19946 cut-off events.
[2024-03-09 05:20:57,692 INFO  L125   PetriNetUnfolderBase]: For 22993/25165 co-relation queries the response was YES.
[2024-03-09 05:20:57,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59186 conditions, 19946 events. 8683/19946 cut-off events. For 22993/25165 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 186144 event pairs, 1558 based on Foata normal form. 67/18966 useless extension candidates. Maximal degree in co-relation 20685. Up to 11899 conditions per place. 
[2024-03-09 05:20:57,794 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-03-09 05:20:57,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:20:57,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:20:57,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:20:57,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-03-09 05:20:57,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-03-09 05:20:57,796 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-03-09 05:20:57,796 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-03-09 05:20:57,796 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:20:57,796 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-03-09 05:20:57,797 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:57,798 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:57,798 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:57,798 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-03-09 05:20:57,799 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:20:57,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 05:20:57,830 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:20:57,831 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517}
[2024-03-09 05:20:57,832 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-03-09 05:20:57,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:20:57,833 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:57,833 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:20:57,833 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:20:57,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:20:57,834 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:20:57,834 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:20:57,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141486319, now seen corresponding path program 1 times
[2024-03-09 05:20:57,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:20:57,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110879775]
[2024-03-09 05:20:57,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:57,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:20:57,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:58,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:58,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:20:58,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110879775]
[2024-03-09 05:20:58,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110879775] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:20:58,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930757896]
[2024-03-09 05:20:58,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:20:58,168 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:20:58,168 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:20:58,169 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:20:58,182 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 05:20:58,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:20:58,325 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 05:20:58,332 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:20:58,337 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:20:58,346 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:20:58,346 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 05:20:58,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2024-03-09 05:20:58,415 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:20:58,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:20:58,609 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:20:58,650 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:20:58,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:20:58,856 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:20:58,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:20:58,896 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:20:58,921 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:20:59,032 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:20:59,053 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:20:59,136 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:20:59,139 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:20:59,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-09 05:20:59,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [930757896] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:20:59,157 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:20:59,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29
[2024-03-09 05:20:59,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038072220]
[2024-03-09 05:20:59,158 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:20:59,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 05:20:59,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:20:59,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 05:20:59,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-03-09 05:20:59,369 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-03-09 05:20:59,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 30 states, 30 states have (on average 53.833333333333336) internal successors, (1615), 30 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:20:59,371 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:20:59,371 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-03-09 05:20:59,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:21:09,644 INFO  L124   PetriNetUnfolderBase]: 28885/54773 cut-off events.
[2024-03-09 05:21:09,644 INFO  L125   PetriNetUnfolderBase]: For 96298/96335 co-relation queries the response was YES.
[2024-03-09 05:21:09,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191013 conditions, 54773 events. 28885/54773 cut-off events. For 96298/96335 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 516545 event pairs, 7011 based on Foata normal form. 385/52624 useless extension candidates. Maximal degree in co-relation 120775. Up to 22271 conditions per place. 
[2024-03-09 05:21:09,973 INFO  L140   encePairwiseOnDemand]: 100/140 looper letters, 891 selfloop transitions, 662 changer transitions 2/1606 dead transitions.
[2024-03-09 05:21:09,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 1606 transitions, 15946 flow
[2024-03-09 05:21:09,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-03-09 05:21:09,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-03-09 05:21:09,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2231 transitions.
[2024-03-09 05:21:09,977 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4979910714285714
[2024-03-09 05:21:09,977 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 2231 transitions.
[2024-03-09 05:21:09,977 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 2231 transitions.
[2024-03-09 05:21:09,978 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:21:09,978 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2231 transitions.
[2024-03-09 05:21:09,981 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 69.71875) internal successors, (2231), 32 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:09,984 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:09,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:09,985 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 32 states and 2231 transitions.
[2024-03-09 05:21:09,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 1606 transitions, 15946 flow
[2024-03-09 05:21:10,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1606 transitions, 15856 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:21:11,013 INFO  L231             Difference]: Finished difference. Result has 223 places, 1096 transitions, 13003 flow
[2024-03-09 05:21:11,014 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=13003, PETRI_PLACES=223, PETRI_TRANSITIONS=1096}
[2024-03-09 05:21:11,014 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places.
[2024-03-09 05:21:11,015 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1096 transitions, 13003 flow
[2024-03-09 05:21:11,015 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 53.833333333333336) internal successors, (1615), 30 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:11,015 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:21:11,016 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:21:11,023 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 05:21:11,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:21:11,217 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:21:11,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:21:11,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 1525661182, now seen corresponding path program 1 times
[2024-03-09 05:21:11,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:21:11,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404582772]
[2024-03-09 05:21:11,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:21:11,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:21:11,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:21:11,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:21:11,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:21:11,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404582772]
[2024-03-09 05:21:11,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404582772] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:21:11,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956608594]
[2024-03-09 05:21:11,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:21:11,543 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:21:11,543 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:21:11,544 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:21:11,545 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 05:21:11,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:21:11,647 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-09 05:21:11,650 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:21:11,658 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:21:11,693 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:21:11,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 05:21:11,735 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2024-03-09 05:21:11,869 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:21:11,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:21:11,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:21:11,987 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:21:12,030 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:21:12,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:21:12,074 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:21:12,093 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false
[2024-03-09 05:21:12,202 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 05:21:12,220 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3) 0))))) is different from false
[2024-03-09 05:21:12,237 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:21:12,237 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 05:21:12,243 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:21:12,243 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-09 05:21:12,247 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:21:12,258 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:21:12,258 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 05:21:12,265 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:21:12,265 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:21:12,273 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:21:12,274 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:21:12,315 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:21:12,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 05:21:12,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956608594] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:21:12,319 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:21:12,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-09 05:21:12,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370206056]
[2024-03-09 05:21:12,320 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:21:12,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 05:21:12,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:21:12,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 05:21:12,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=12, NotChecked=156, Total=870
[2024-03-09 05:21:12,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-03-09 05:21:12,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1096 transitions, 13003 flow. Second operand  has 30 states, 30 states have (on average 61.266666666666666) internal successors, (1838), 30 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:12,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:21:12,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-03-09 05:21:12,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:21:26,578 INFO  L124   PetriNetUnfolderBase]: 28453/54075 cut-off events.
[2024-03-09 05:21:26,578 INFO  L125   PetriNetUnfolderBase]: For 208422/208447 co-relation queries the response was YES.
[2024-03-09 05:21:26,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 237818 conditions, 54075 events. 28453/54075 cut-off events. For 208422/208447 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 501970 event pairs, 4795 based on Foata normal form. 256/51386 useless extension candidates. Maximal degree in co-relation 218636. Up to 15898 conditions per place. 
[2024-03-09 05:21:27,089 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1319 selfloop transitions, 813 changer transitions 0/2200 dead transitions.
[2024-03-09 05:21:27,089 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2200 transitions, 27966 flow
[2024-03-09 05:21:27,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 05:21:27,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 05:21:27,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2293 transitions.
[2024-03-09 05:21:27,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.545952380952381
[2024-03-09 05:21:27,092 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2293 transitions.
[2024-03-09 05:21:27,092 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2293 transitions.
[2024-03-09 05:21:27,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:21:27,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2293 transitions.
[2024-03-09 05:21:27,096 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 76.43333333333334) internal successors, (2293), 30 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:27,099 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:27,100 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:27,100 INFO  L175             Difference]: Start difference. First operand has 223 places, 1096 transitions, 13003 flow. Second operand 30 states and 2293 transitions.
[2024-03-09 05:21:27,100 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2200 transitions, 27966 flow
[2024-03-09 05:21:31,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2200 transitions, 27895 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-03-09 05:21:31,278 INFO  L231             Difference]: Finished difference. Result has 263 places, 1510 transitions, 21452 flow
[2024-03-09 05:21:31,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=12933, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=21452, PETRI_PLACES=263, PETRI_TRANSITIONS=1510}
[2024-03-09 05:21:31,279 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places.
[2024-03-09 05:21:31,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 1510 transitions, 21452 flow
[2024-03-09 05:21:31,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 61.266666666666666) internal successors, (1838), 30 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:31,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:21:31,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:21:31,288 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 05:21:31,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-09 05:21:31,482 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:21:31,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:21:31,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 659297603, now seen corresponding path program 1 times
[2024-03-09 05:21:31,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:21:31,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871368340]
[2024-03-09 05:21:31,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:21:31,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:21:31,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:21:31,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 05:21:31,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:21:31,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871368340]
[2024-03-09 05:21:31,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871368340] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:21:31,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:21:31,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:21:31,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170215420]
[2024-03-09 05:21:31,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:21:31,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:21:31,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:21:31,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:21:31,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:21:31,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-03-09 05:21:31,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1510 transitions, 21452 flow. Second operand  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:31,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:21:31,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-03-09 05:21:31,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:21:37,987 INFO  L124   PetriNetUnfolderBase]: 11980/27567 cut-off events.
[2024-03-09 05:21:37,988 INFO  L125   PetriNetUnfolderBase]: For 158937/160971 co-relation queries the response was YES.
[2024-03-09 05:21:38,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 134920 conditions, 27567 events. 11980/27567 cut-off events. For 158937/160971 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 267901 event pairs, 934 based on Foata normal form. 205/26900 useless extension candidates. Maximal degree in co-relation 133919. Up to 10817 conditions per place. 
[2024-03-09 05:21:38,332 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1123 selfloop transitions, 180 changer transitions 0/1687 dead transitions.
[2024-03-09 05:21:38,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1687 transitions, 26473 flow
[2024-03-09 05:21:38,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:21:38,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:21:38,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-03-09 05:21:38,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-03-09 05:21:38,334 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-03-09 05:21:38,334 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-03-09 05:21:38,334 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:21:38,334 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-03-09 05:21:38,335 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:38,336 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:38,336 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:38,336 INFO  L175             Difference]: Start difference. First operand has 263 places, 1510 transitions, 21452 flow. Second operand 6 states and 737 transitions.
[2024-03-09 05:21:38,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1687 transitions, 26473 flow
[2024-03-09 05:21:39,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1687 transitions, 26265 flow, removed 82 selfloop flow, removed 10 redundant places.
[2024-03-09 05:21:39,949 INFO  L231             Difference]: Finished difference. Result has 263 places, 1685 transitions, 24494 flow
[2024-03-09 05:21:39,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21244, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24494, PETRI_PLACES=263, PETRI_TRANSITIONS=1685}
[2024-03-09 05:21:39,950 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places.
[2024-03-09 05:21:39,950 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 1685 transitions, 24494 flow
[2024-03-09 05:21:39,950 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:39,950 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:21:39,950 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:21:39,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:21:39,951 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:21:39,951 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:21:39,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -1796263229, now seen corresponding path program 1 times
[2024-03-09 05:21:39,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:21:39,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137601423]
[2024-03-09 05:21:39,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:21:39,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:21:39,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:21:40,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:21:40,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:21:40,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137601423]
[2024-03-09 05:21:40,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137601423] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:21:40,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938259632]
[2024-03-09 05:21:40,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:21:40,260 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:21:40,260 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:21:40,261 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:21:40,265 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 05:21:40,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:21:40,396 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 05:21:40,399 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:21:40,482 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:21:40,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:21:40,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:21:40,702 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:21:40,734 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:21:40,778 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:21:40,779 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:21:40,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:21:40,807 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:21:40,838 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:21:40,854 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:21:40,868 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:21:41,019 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-09 05:21:41,023 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:21:41,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:21:41,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938259632] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:21:41,058 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:21:41,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34
[2024-03-09 05:21:41,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668251570]
[2024-03-09 05:21:41,058 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:21:41,058 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-09 05:21:41,059 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:21:41,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-09 05:21:41,059 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=876, Unknown=3, NotChecked=186, Total=1190
[2024-03-09 05:21:41,366 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 140
[2024-03-09 05:21:41,368 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1685 transitions, 24494 flow. Second operand  has 35 states, 35 states have (on average 55.02857142857143) internal successors, (1926), 35 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:21:41,368 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:21:41,368 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 140
[2024-03-09 05:21:41,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:22:03,804 INFO  L124   PetriNetUnfolderBase]: 36868/68661 cut-off events.
[2024-03-09 05:22:03,804 INFO  L125   PetriNetUnfolderBase]: For 383435/383567 co-relation queries the response was YES.
[2024-03-09 05:22:04,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340449 conditions, 68661 events. 36868/68661 cut-off events. For 383435/383567 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 650768 event pairs, 6618 based on Foata normal form. 619/66337 useless extension candidates. Maximal degree in co-relation 338057. Up to 36408 conditions per place. 
[2024-03-09 05:22:04,678 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 1683 selfloop transitions, 851 changer transitions 2/2601 dead transitions.
[2024-03-09 05:22:04,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 2601 transitions, 39014 flow
[2024-03-09 05:22:04,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 05:22:04,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 05:22:04,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1817 transitions.
[2024-03-09 05:22:04,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5191428571428571
[2024-03-09 05:22:04,681 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1817 transitions.
[2024-03-09 05:22:04,681 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1817 transitions.
[2024-03-09 05:22:04,681 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:22:04,681 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1817 transitions.
[2024-03-09 05:22:04,683 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 72.68) internal successors, (1817), 25 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:04,686 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 140.0) internal successors, (3640), 26 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:04,686 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 140.0) internal successors, (3640), 26 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:04,687 INFO  L175             Difference]: Start difference. First operand has 263 places, 1685 transitions, 24494 flow. Second operand 25 states and 1817 transitions.
[2024-03-09 05:22:04,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 2601 transitions, 39014 flow
[2024-03-09 05:22:14,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 2601 transitions, 38894 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-09 05:22:14,232 INFO  L231             Difference]: Finished difference. Result has 295 places, 2096 transitions, 33784 flow
[2024-03-09 05:22:14,233 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24374, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=550, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=33784, PETRI_PLACES=295, PETRI_TRANSITIONS=2096}
[2024-03-09 05:22:14,234 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 155 predicate places.
[2024-03-09 05:22:14,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 2096 transitions, 33784 flow
[2024-03-09 05:22:14,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 55.02857142857143) internal successors, (1926), 35 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:14,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:22:14,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:22:14,240 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 05:22:14,435 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:22:14,436 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:22:14,437 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:22:14,437 INFO  L85        PathProgramCache]: Analyzing trace with hash -1129307511, now seen corresponding path program 1 times
[2024-03-09 05:22:14,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:22:14,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940882824]
[2024-03-09 05:22:14,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:22:14,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:22:14,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:22:14,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:22:14,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:22:14,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940882824]
[2024-03-09 05:22:14,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940882824] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:22:14,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597889151]
[2024-03-09 05:22:14,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:22:14,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:22:14,812 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:22:14,812 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:22:14,817 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 05:22:14,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:22:14,910 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 05:22:14,913 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:22:15,022 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-09 05:22:15,149 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:22:15,179 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:22:15,213 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:22:15,260 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:22:15,412 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:22:15,413 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:22:15,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:22:15,446 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:22:15,468 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 05:22:15,539 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-03-09 05:22:15,577 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2024-03-09 05:22:15,631 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~p~0.base_25) (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_25 v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2)))))))) is different from false
[2024-03-09 05:22:15,819 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:22:15,819 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 05:22:15,825 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:22:15,825 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-09 05:22:15,828 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:22:15,836 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:22:15,836 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:22:15,842 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:22:15,842 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 05:22:15,850 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:22:15,850 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:22:15,966 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-09 05:22:16,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:22:16,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [597889151] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:22:16,013 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:22:16,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36
[2024-03-09 05:22:16,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556009797]
[2024-03-09 05:22:16,013 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:22:16,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-03-09 05:22:16,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:22:16,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-03-09 05:22:16,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=914, Unknown=18, NotChecked=260, Total=1332
[2024-03-09 05:22:16,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-03-09 05:22:16,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 2096 transitions, 33784 flow. Second operand  has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:16,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:22:16,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-03-09 05:22:16,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:22:44,096 INFO  L124   PetriNetUnfolderBase]: 38469/72951 cut-off events.
[2024-03-09 05:22:44,097 INFO  L125   PetriNetUnfolderBase]: For 591077/591318 co-relation queries the response was YES.
[2024-03-09 05:22:44,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 414680 conditions, 72951 events. 38469/72951 cut-off events. For 591077/591318 co-relation queries the response was YES. Maximal size of possible extension queue 1877. Compared 701154 event pairs, 5231 based on Foata normal form. 318/69720 useless extension candidates. Maximal degree in co-relation 411947. Up to 30035 conditions per place. 
[2024-03-09 05:22:45,130 INFO  L140   encePairwiseOnDemand]: 103/140 looper letters, 1933 selfloop transitions, 1280 changer transitions 0/3299 dead transitions.
[2024-03-09 05:22:45,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 3299 transitions, 57685 flow
[2024-03-09 05:22:45,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-09 05:22:45,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-09 05:22:45,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1580 transitions.
[2024-03-09 05:22:45,134 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5642857142857143
[2024-03-09 05:22:45,134 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1580 transitions.
[2024-03-09 05:22:45,134 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1580 transitions.
[2024-03-09 05:22:45,135 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:22:45,135 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1580 transitions.
[2024-03-09 05:22:45,137 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 79.0) internal successors, (1580), 20 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:45,139 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:45,139 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:22:45,139 INFO  L175             Difference]: Start difference. First operand has 295 places, 2096 transitions, 33784 flow. Second operand 20 states and 1580 transitions.
[2024-03-09 05:22:45,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 3299 transitions, 57685 flow
[2024-03-09 05:23:04,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 3299 transitions, 57523 flow, removed 63 selfloop flow, removed 14 redundant places.
[2024-03-09 05:23:04,801 INFO  L231             Difference]: Finished difference. Result has 309 places, 2765 transitions, 51507 flow
[2024-03-09 05:23:04,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=33626, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=629, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=51507, PETRI_PLACES=309, PETRI_TRANSITIONS=2765}
[2024-03-09 05:23:04,804 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 169 predicate places.
[2024-03-09 05:23:04,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 2765 transitions, 51507 flow
[2024-03-09 05:23:04,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:23:04,805 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:23:04,805 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:23:04,811 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 05:23:05,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 05:23:05,007 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:23:05,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:23:05,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922724183, now seen corresponding path program 2 times
[2024-03-09 05:23:05,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:23:05,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863095685]
[2024-03-09 05:23:05,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:23:05,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:23:05,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:23:05,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:23:05,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:23:05,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863095685]
[2024-03-09 05:23:05,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863095685] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:23:05,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907374059]
[2024-03-09 05:23:05,457 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:23:05,457 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:23:05,457 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:23:05,458 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:23:05,459 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 05:23:05,595 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:23:05,595 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:23:05,596 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-09 05:23:05,598 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:23:05,670 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-03-09 05:23:05,835 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:23:05,918 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 05:23:05,961 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:23:05,962 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:23:06,007 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:23:06,007 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 05:23:06,061 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:23:06,063 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 05:23:06,147 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:23:06,148 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 05:23:06,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:23:06,159 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:23:06,286 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:23:06,308 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-03-09 05:23:06,329 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:23:06,633 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15
[2024-03-09 05:23:06,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:23:06,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [907374059] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:23:06,717 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:23:06,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38
[2024-03-09 05:23:06,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544308448]
[2024-03-09 05:23:06,717 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:23:06,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-09 05:23:06,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:23:06,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-09 05:23:06,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1118, Unknown=10, NotChecked=210, Total=1482
[2024-03-09 05:23:07,000 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 140
[2024-03-09 05:23:07,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 2765 transitions, 51507 flow. Second operand  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:23:07,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:23:07,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 140
[2024-03-09 05:23:07,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:23:47,991 INFO  L124   PetriNetUnfolderBase]: 44926/82915 cut-off events.
[2024-03-09 05:23:47,992 INFO  L125   PetriNetUnfolderBase]: For 856945/857101 co-relation queries the response was YES.
[2024-03-09 05:23:48,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 505862 conditions, 82915 events. 44926/82915 cut-off events. For 856945/857101 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 785342 event pairs, 5975 based on Foata normal form. 665/79622 useless extension candidates. Maximal degree in co-relation 502464. Up to 26834 conditions per place. 
[2024-03-09 05:23:49,241 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1821 selfloop transitions, 2043 changer transitions 1/3921 dead transitions.
[2024-03-09 05:23:49,241 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 3921 transitions, 74397 flow
[2024-03-09 05:23:49,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-09 05:23:49,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-09 05:23:49,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2256 transitions.
[2024-03-09 05:23:49,245 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198156682027649
[2024-03-09 05:23:49,245 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2256 transitions.
[2024-03-09 05:23:49,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2256 transitions.
[2024-03-09 05:23:49,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:23:49,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2256 transitions.
[2024-03-09 05:23:49,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 72.7741935483871) internal successors, (2256), 31 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:23:49,251 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:23:49,251 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:23:49,251 INFO  L175             Difference]: Start difference. First operand has 309 places, 2765 transitions, 51507 flow. Second operand 31 states and 2256 transitions.
[2024-03-09 05:23:49,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 3921 transitions, 74397 flow
[2024-03-09 05:24:08,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 3921 transitions, 74302 flow, removed 18 selfloop flow, removed 10 redundant places.
[2024-03-09 05:24:08,516 INFO  L231             Difference]: Finished difference. Result has 341 places, 3266 transitions, 69366 flow
[2024-03-09 05:24:08,518 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=51434, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1653, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1028, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=69366, PETRI_PLACES=341, PETRI_TRANSITIONS=3266}
[2024-03-09 05:24:08,518 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 201 predicate places.
[2024-03-09 05:24:08,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 3266 transitions, 69366 flow
[2024-03-09 05:24:08,519 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:24:08,519 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:08,519 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:24:08,526 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 05:24:08,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-09 05:24:08,721 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:24:08,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:08,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -725850290, now seen corresponding path program 1 times
[2024-03-09 05:24:08,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:08,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660832459]
[2024-03-09 05:24:08,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:08,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:08,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:10,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:10,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:10,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660832459]
[2024-03-09 05:24:10,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660832459] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:24:10,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885333205]
[2024-03-09 05:24:10,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:10,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:24:10,319 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:10,320 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:24:10,322 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 05:24:10,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:10,472 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 66 conjunts are in the unsatisfiable core
[2024-03-09 05:24:10,479 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:24:10,599 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:24:10,658 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:24:10,658 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 05:24:10,796 INFO  L349             Elim1Store]: treesize reduction 32, result has 45.8 percent of original size
[2024-03-09 05:24:10,797 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33
[2024-03-09 05:24:10,877 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:24:10,884 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:24:10,884 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 05:24:11,158 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:24:11,605 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 05:24:11,605 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-03-09 05:24:11,645 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2024-03-09 05:24:12,189 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-03-09 05:24:12,189 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 63
[2024-03-09 05:24:12,591 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:12,591 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50
[2024-03-09 05:24:12,678 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:24:12,801 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:24:12,870 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:24:12,948 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:24:13,032 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:24:13,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:13,100 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:24:13,119 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1160 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:24:13,147 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1160 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:24:13,167 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1160 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1160) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:24:13,310 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:13,310 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 05:24:13,317 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:13,317 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2024-03-09 05:24:13,327 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:13,327 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 05:24:13,335 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:13,335 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:24:13,340 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:13,340 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:24:13,537 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:24:13,543 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:24:13,550 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-09 05:24:13,675 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-09 05:24:13,717 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) .cse0 v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0)))) is different from false
[2024-03-09 05:24:13,874 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:24:14,207 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:14,207 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 82
[2024-03-09 05:24:14,215 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-03-09 05:24:14,220 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-09 05:24:14,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:14,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885333205] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:24:14,600 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:24:14,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 22] total 66
[2024-03-09 05:24:14,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082610016]
[2024-03-09 05:24:14,600 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:24:14,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 67 states
[2024-03-09 05:24:14,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:14,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants.
[2024-03-09 05:24:14,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3184, Unknown=32, NotChecked=968, Total=4422
[2024-03-09 05:24:14,605 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 31 out of 140
[2024-03-09 05:24:14,606 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 3266 transitions, 69366 flow. Second operand  has 67 states, 67 states have (on average 33.417910447761194) internal successors, (2239), 67 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:24:14,606 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:14,606 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 140
[2024-03-09 05:24:14,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:30,719 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse7 (= (select |c_#valid| .cse1) 1)) (.cse0 (+ .cse2 2)) (.cse11 (+ |c_#StackHeapBarrier| 1)) (.cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) (not (= c_threadThread1of2ForFork0_~p~0.base .cse1)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse1)) (not (= .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) (= c_threadThread1of2ForFork0_~p~0.offset 0) .cse3 (or (exists ((|ULTIMATE.start_main_~#datas~0#1.base| Int) (|ULTIMATE.start_main_~#datas~0#1.offset| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#datas~0#1.base|) |ULTIMATE.start_main_~#datas~0#1.offset|))) (let ((.cse5 (+ .cse4 2))) (and (not (= .cse4 .cse1)) (<= .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse5 |ULTIMATE.start_main_~#datas~0#1.base|) (= .cse4 |c_threadThread1of2ForFork0_#in~arg.base|))))) (let ((.cse6 (+ |c_threadThread1of2ForFork0_#in~arg.base| 2))) (and (<= .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse6 .cse1)))) (<= 0 c_threadThread1of2ForFork0_~p~0.offset) .cse7 (or (let ((.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.base))) (and (<= .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse8 .cse1))) (exists ((|ULTIMATE.start_main_~#datas~0#1.base| Int) (|ULTIMATE.start_main_~#datas~0#1.offset| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#datas~0#1.base|) |ULTIMATE.start_main_~#datas~0#1.offset|))) (let ((.cse10 (+ .cse9 2))) (and (= .cse9 c_threadThread1of2ForFork0_~p~0.base) (not (= .cse9 .cse1)) (<= .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse10 |ULTIMATE.start_main_~#datas~0#1.base|)))))) (<= .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) (not (= .cse2 .cse1)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_threadThread1of2ForFork0_~p~0.base)) (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (or (= .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse7) (or (let ((.cse12 (+ c_threadThread1of2ForFork0_~arg.base 2))) (and (<= .cse12 .cse1) (<= .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (exists ((|ULTIMATE.start_main_~#datas~0#1.base| Int) (|ULTIMATE.start_main_~#datas~0#1.offset| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#datas~0#1.base|) |ULTIMATE.start_main_~#datas~0#1.offset|))) (let ((.cse14 (+ .cse13 2))) (and (not (= .cse13 .cse1)) (<= .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#datas~0#1.base|) (= .cse13 c_threadThread1of2ForFork0_~arg.base)))))) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= c_threadThread1of2ForFork0_~arg.offset 0) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (<= .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse11 |c_ULTIMATE.start_main_~#datas~0#1.base|) (or .cse3 (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~#datas~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) is different from false
[2024-03-09 05:24:37,594 WARN  L854   $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|)) is different from false
[2024-03-09 05:26:28,312 INFO  L124   PetriNetUnfolderBase]: 96097/172653 cut-off events.
[2024-03-09 05:26:28,312 INFO  L125   PetriNetUnfolderBase]: For 2697864/2697904 co-relation queries the response was YES.
[2024-03-09 05:26:30,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1180558 conditions, 172653 events. 96097/172653 cut-off events. For 2697864/2697904 co-relation queries the response was YES. Maximal size of possible extension queue 3818. Compared 1729347 event pairs, 23863 based on Foata normal form. 32/164338 useless extension candidates. Maximal degree in co-relation 1178025. Up to 69649 conditions per place. 
[2024-03-09 05:26:31,646 INFO  L140   encePairwiseOnDemand]: 68/140 looper letters, 7047 selfloop transitions, 1154 changer transitions 420/8652 dead transitions.
[2024-03-09 05:26:31,646 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 8652 transitions, 186929 flow
[2024-03-09 05:26:31,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. 
[2024-03-09 05:26:31,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2024-03-09 05:26:31,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 4198 transitions.
[2024-03-09 05:26:31,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.30913107511045657
[2024-03-09 05:26:31,652 INFO  L72            ComplementDD]: Start complementDD. Operand 97 states and 4198 transitions.
[2024-03-09 05:26:31,652 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 97 states and 4198 transitions.
[2024-03-09 05:26:31,653 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:26:31,653 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 4198 transitions.
[2024-03-09 05:26:31,659 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 98 states, 97 states have (on average 43.27835051546392) internal successors, (4198), 97 states have internal predecessors, (4198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:26:31,667 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 98 states, 98 states have (on average 140.0) internal successors, (13720), 98 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:26:31,668 INFO  L81            ComplementDD]: Finished complementDD. Result  has 98 states, 98 states have (on average 140.0) internal successors, (13720), 98 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:26:31,669 INFO  L175             Difference]: Start difference. First operand has 341 places, 3266 transitions, 69366 flow. Second operand 97 states and 4198 transitions.
[2024-03-09 05:26:31,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 8652 transitions, 186929 flow
[2024-03-09 05:30:27,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 8652 transitions, 185565 flow, removed 637 selfloop flow, removed 16 redundant places.
[2024-03-09 05:30:27,967 INFO  L231             Difference]: Finished difference. Result has 479 places, 4195 transitions, 93284 flow
[2024-03-09 05:30:27,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=68798, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=93284, PETRI_PLACES=479, PETRI_TRANSITIONS=4195}
[2024-03-09 05:30:27,969 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 339 predicate places.
[2024-03-09 05:30:27,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 479 places, 4195 transitions, 93284 flow
[2024-03-09 05:30:27,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 67 states, 67 states have (on average 33.417910447761194) internal successors, (2239), 67 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:30:27,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:30:27,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:30:27,979 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 05:30:28,171 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:30:28,172 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:30:28,172 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:30:28,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 1999094568, now seen corresponding path program 2 times
[2024-03-09 05:30:28,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:30:28,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968021925]
[2024-03-09 05:30:28,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:30:28,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:30:28,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:30:28,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:30:28,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:30:28,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968021925]
[2024-03-09 05:30:28,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968021925] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:30:28,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939074910]
[2024-03-09 05:30:28,983 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:30:28,983 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:30:28,983 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:30:28,984 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:30:28,986 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 05:30:29,138 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:30:29,139 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:30:29,140 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 05:30:29,146 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:30:29,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 05:30:29,270 INFO  L349             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-03-09 05:30:29,271 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18
[2024-03-09 05:30:29,345 INFO  L349             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-03-09 05:30:29,345 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 05:30:29,593 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 05:30:30,063 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 05:30:30,063 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-03-09 05:30:30,073 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17
[2024-03-09 05:30:30,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:30:30,384 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 05:30:30,410 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 05:30:30,483 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:30:30,569 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 05:30:30,675 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:30:30,913 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 05:30:30,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:30:30,994 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:30:31,022 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:30:31,023 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:30:31,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:30:31,056 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:30:31,073 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:30:31,074 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:30:31,158 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:30:31,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:30:31,210 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:30:31,230 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false
[2024-03-09 05:30:31,266 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false
[2024-03-09 05:30:31,319 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse0 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse0 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse0 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse0 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false
[2024-03-09 05:30:31,410 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:30:31,434 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1282) .cse1 v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse3)))))) is different from false
[2024-03-09 05:30:31,812 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-09 05:30:32,133 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:30:32,133 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 93
[2024-03-09 05:30:32,150 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53
[2024-03-09 05:30:32,304 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:30:32,305 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46
[2024-03-09 05:30:32,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:30:32,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939074910] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:30:32,380 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:30:32,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 53
[2024-03-09 05:30:32,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677427128]
[2024-03-09 05:30:32,381 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:30:32,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 54 states
[2024-03-09 05:30:32,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:30:32,383 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2024-03-09 05:30:32,384 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2153, Unknown=8, NotChecked=490, Total=2862
[2024-03-09 05:30:32,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-03-09 05:30:32,648 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 4195 transitions, 93284 flow. Second operand  has 54 states, 54 states have (on average 47.48148148148148) internal successors, (2564), 54 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:30:32,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:30:32,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-03-09 05:30:32,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
