./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-index-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-index-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 4f65df5e606a8261702fe9d1f480f8ea4723a652ddeb9dc0601e1240905d046f
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 04:42:05,640 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 04:42:05,679 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 04:42:05,683 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 04:42:05,683 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 04:42:05,698 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 04:42:05,698 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 04:42:05,699 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 04:42:05,699 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 04:42:05,700 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 04:42:05,700 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 04:42:05,701 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 04:42:05,701 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 04:42:05,701 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 04:42:05,702 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 04:42:05,702 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 04:42:05,702 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 04:42:05,703 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 04:42:05,703 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 04:42:05,703 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 04:42:05,703 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 04:42:05,704 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 04:42:05,704 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 04:42:05,705 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 04:42:05,705 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 04:42:05,705 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 04:42:05,706 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 04:42:05,706 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 04:42:05,706 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 04:42:05,706 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 04:42:05,707 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 04:42:05,707 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 04:42:05,707 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 04:42:05,707 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 04:42:05,708 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 04:42:05,708 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 04:42:05,708 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 04:42:05,708 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 04:42:05,709 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 04:42:05,709 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 04:42:05,709 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 04:42:05,710 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 -> 4f65df5e606a8261702fe9d1f480f8ea4723a652ddeb9dc0601e1240905d046f
[2024-03-09 04:42:05,893 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 04:42:05,923 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 04:42:05,925 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 04:42:05,926 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 04:42:05,928 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 04:42:05,929 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-09 04:42:06,999 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 04:42:07,195 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 04:42:07,196 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-09 04:42:07,213 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/e79346ca1/8f5145c91ea14ab6b1eeacbbe7293e8d/FLAG033d0d910
[2024-03-09 04:42:07,570 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/e79346ca1/8f5145c91ea14ab6b1eeacbbe7293e8d
[2024-03-09 04:42:07,573 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 04:42:07,575 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 04:42:07,577 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 04:42:07,577 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 04:42:07,583 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 04:42:07,584 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:07,585 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767212b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07, skipping insertion in model container
[2024-03-09 04:42:07,586 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:07,624 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 04:42:07,895 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 04:42:07,902 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 04:42:07,932 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 04:42:07,969 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 04:42:07,969 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07 WrapperNode
[2024-03-09 04:42:07,969 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 04:42:07,970 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 04:42:07,970 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 04:42:07,971 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 04:42:07,975 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:07,988 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,006 INFO  L138                Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87
[2024-03-09 04:42:08,007 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 04:42:08,007 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 04:42:08,007 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 04:42:08,008 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 04:42:08,015 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,015 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,018 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,018 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,024 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,027 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,028 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,029 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,031 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 04:42:08,032 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 04:42:08,032 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 04:42:08,032 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 04:42:08,033 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (1/1) ...
[2024-03-09 04:42:08,037 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 04:42:08,044 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:42:08,054 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 04:42:08,057 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 04:42:08,077 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 04:42:08,078 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 04:42:08,079 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 04:42:08,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 04:42:08,079 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 04:42:08,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 04:42:08,080 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 04:42:08,217 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 04:42:08,218 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 04:42:08,392 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 04:42:08,400 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 04:42:08,401 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 04:42:08,402 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 04:42:08 BoogieIcfgContainer
[2024-03-09 04:42:08,402 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 04:42:08,403 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 04:42:08,404 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 04:42:08,406 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 04:42:08,406 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:42:07" (1/3) ...
[2024-03-09 04:42:08,407 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424c3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:42:08, skipping insertion in model container
[2024-03-09 04:42:08,407 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:07" (2/3) ...
[2024-03-09 04:42:08,407 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424c3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:42:08, skipping insertion in model container
[2024-03-09 04:42:08,407 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 04:42:08" (3/3) ...
[2024-03-09 04:42:08,408 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2024-03-09 04:42:08,414 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 04:42:08,421 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 04:42:08,421 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-09 04:42:08,422 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 04:42:08,481 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 04:42:08,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 239 flow
[2024-03-09 04:42:08,561 INFO  L124   PetriNetUnfolderBase]: 6/168 cut-off events.
[2024-03-09 04:42:08,561 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 04:42:08,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 173 conditions, 168 events. 6/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. 
[2024-03-09 04:42:08,566 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 239 flow
[2024-03-09 04:42:08,569 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 239 flow
[2024-03-09 04:42:08,576 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 04:42:08,582 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;@67a3088c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 04:42:08,583 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 04:42:08,588 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 04:42:08,588 INFO  L124   PetriNetUnfolderBase]: 1/25 cut-off events.
[2024-03-09 04:42:08,588 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 04:42:08,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:08,589 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]
[2024-03-09 04:42:08,589 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:08,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:08,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 404439146, now seen corresponding path program 1 times
[2024-03-09 04:42:08,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:08,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756618591]
[2024-03-09 04:42:08,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:08,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:08,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:08,784 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 04:42:08,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:08,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756618591]
[2024-03-09 04:42:08,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756618591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:08,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:08,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 04:42:08,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455257617]
[2024-03-09 04:42:08,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:08,794 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 04:42:08,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:08,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 04:42:08,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 04:42:08,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116
[2024-03-09 04:42:08,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 239 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 04:42:08,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:08,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116
[2024-03-09 04:42:08,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:08,889 INFO  L124   PetriNetUnfolderBase]: 3/198 cut-off events.
[2024-03-09 04:42:08,890 INFO  L125   PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES.
[2024-03-09 04:42:08,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 220 conditions, 198 events. 3/198 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 454 event pairs, 2 based on Foata normal form. 5/180 useless extension candidates. Maximal degree in co-relation 119. Up to 15 conditions per place. 
[2024-03-09 04:42:08,892 INFO  L140   encePairwiseOnDemand]: 110/116 looper letters, 8 selfloop transitions, 2 changer transitions 1/112 dead transitions.
[2024-03-09 04:42:08,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 251 flow
[2024-03-09 04:42:08,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 04:42:08,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 04:42:08,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions.
[2024-03-09 04:42:08,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9195402298850575
[2024-03-09 04:42:08,903 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 320 transitions.
[2024-03-09 04:42:08,903 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions.
[2024-03-09 04:42:08,905 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:08,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions.
[2024-03-09 04:42:08,909 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 04:42:08,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 04:42:08,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 04:42:08,914 INFO  L175             Difference]: Start difference. First operand has 115 places, 116 transitions, 239 flow. Second operand 3 states and 320 transitions.
[2024-03-09 04:42:08,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 251 flow
[2024-03-09 04:42:08,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 251 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:08,920 INFO  L231             Difference]: Finished difference. Result has 116 places, 111 transitions, 233 flow
[2024-03-09 04:42:08,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=116, PETRI_TRANSITIONS=111}
[2024-03-09 04:42:08,924 INFO  L281   CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places.
[2024-03-09 04:42:08,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 233 flow
[2024-03-09 04:42:08,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 04:42:08,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:08,925 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]
[2024-03-09 04:42:08,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 04:42:08,926 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:08,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:08,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 356448222, now seen corresponding path program 1 times
[2024-03-09 04:42:08,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:08,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812666858]
[2024-03-09 04:42:08,927 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:08,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:08,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:09,309 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 04:42:09,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:09,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812666858]
[2024-03-09 04:42:09,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812666858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:09,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:09,310 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:09,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729010201]
[2024-03-09 04:42:09,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:09,311 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:09,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:09,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:09,312 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:09,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116
[2024-03-09 04:42:09,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 111 transitions, 233 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 04:42:09,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:09,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116
[2024-03-09 04:42:09,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:09,706 INFO  L124   PetriNetUnfolderBase]: 117/600 cut-off events.
[2024-03-09 04:42:09,706 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-03-09 04:42:09,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 915 conditions, 600 events. 117/600 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3346 event pairs, 6 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 881. Up to 194 conditions per place. 
[2024-03-09 04:42:09,712 INFO  L140   encePairwiseOnDemand]: 93/116 looper letters, 38 selfloop transitions, 29 changer transitions 0/150 dead transitions.
[2024-03-09 04:42:09,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 448 flow
[2024-03-09 04:42:09,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:09,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:09,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions.
[2024-03-09 04:42:09,718 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2024-03-09 04:42:09,718 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 580 transitions.
[2024-03-09 04:42:09,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions.
[2024-03-09 04:42:09,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:09,719 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions.
[2024-03-09 04:42:09,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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 04:42:09,723 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:09,723 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:09,723 INFO  L175             Difference]: Start difference. First operand has 116 places, 111 transitions, 233 flow. Second operand 6 states and 580 transitions.
[2024-03-09 04:42:09,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 448 flow
[2024-03-09 04:42:09,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 150 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 04:42:09,728 INFO  L231             Difference]: Finished difference. Result has 123 places, 140 transitions, 449 flow
[2024-03-09 04:42:09,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=123, PETRI_TRANSITIONS=140}
[2024-03-09 04:42:09,729 INFO  L281   CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places.
[2024-03-09 04:42:09,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 140 transitions, 449 flow
[2024-03-09 04:42:09,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 04:42:09,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:09,731 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]
[2024-03-09 04:42:09,731 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 04:42:09,731 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:09,732 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:09,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1151922991, now seen corresponding path program 1 times
[2024-03-09 04:42:09,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:09,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293160158]
[2024-03-09 04:42:09,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:09,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:09,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:09,768 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 04:42:09,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:09,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293160158]
[2024-03-09 04:42:09,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293160158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:09,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:09,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 04:42:09,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943227295]
[2024-03-09 04:42:09,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:09,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 04:42:09,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:09,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 04:42:09,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 04:42:09,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 116
[2024-03-09 04:42:09,781 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 140 transitions, 449 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 04:42:09,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:09,782 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 116
[2024-03-09 04:42:09,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:09,841 INFO  L124   PetriNetUnfolderBase]: 90/605 cut-off events.
[2024-03-09 04:42:09,841 INFO  L125   PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES.
[2024-03-09 04:42:09,843 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 605 events. 90/605 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3454 event pairs, 5 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 853. Up to 109 conditions per place. 
[2024-03-09 04:42:09,845 INFO  L140   encePairwiseOnDemand]: 112/116 looper letters, 7 selfloop transitions, 2 changer transitions 0/140 dead transitions.
[2024-03-09 04:42:09,845 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 140 transitions, 467 flow
[2024-03-09 04:42:09,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 04:42:09,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 04:42:09,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions.
[2024-03-09 04:42:09,847 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9281609195402298
[2024-03-09 04:42:09,847 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 323 transitions.
[2024-03-09 04:42:09,847 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions.
[2024-03-09 04:42:09,847 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:09,847 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions.
[2024-03-09 04:42:09,848 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 04:42:09,849 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 04:42:09,850 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 04:42:09,850 INFO  L175             Difference]: Start difference. First operand has 123 places, 140 transitions, 449 flow. Second operand 3 states and 323 transitions.
[2024-03-09 04:42:09,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 140 transitions, 467 flow
[2024-03-09 04:42:09,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 140 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:09,855 INFO  L231             Difference]: Finished difference. Result has 124 places, 140 transitions, 459 flow
[2024-03-09 04:42:09,856 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=124, PETRI_TRANSITIONS=140}
[2024-03-09 04:42:09,856 INFO  L281   CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places.
[2024-03-09 04:42:09,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 140 transitions, 459 flow
[2024-03-09 04:42:09,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 04:42:09,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:09,857 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]
[2024-03-09 04:42:09,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 04:42:09,858 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:09,858 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:09,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -30078299, now seen corresponding path program 1 times
[2024-03-09 04:42:09,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:09,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598503759]
[2024-03-09 04:42:09,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:09,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:09,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:09,935 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 04:42:09,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:09,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598503759]
[2024-03-09 04:42:09,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598503759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:09,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:09,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:09,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179808900]
[2024-03-09 04:42:09,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:09,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 04:42:09,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:09,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 04:42:09,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 04:42:10,007 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 116
[2024-03-09 04:42:10,008 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 140 transitions, 459 flow. Second operand  has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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 04:42:10,008 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:10,009 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 116
[2024-03-09 04:42:10,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:10,068 INFO  L124   PetriNetUnfolderBase]: 83/563 cut-off events.
[2024-03-09 04:42:10,068 INFO  L125   PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES.
[2024-03-09 04:42:10,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 563 events. 83/563 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3132 event pairs, 3 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 866. Up to 102 conditions per place. 
[2024-03-09 04:42:10,071 INFO  L140   encePairwiseOnDemand]: 108/116 looper letters, 11 selfloop transitions, 2 changer transitions 5/145 dead transitions.
[2024-03-09 04:42:10,071 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 145 transitions, 505 flow
[2024-03-09 04:42:10,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:10,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:10,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions.
[2024-03-09 04:42:10,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.889367816091954
[2024-03-09 04:42:10,073 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 619 transitions.
[2024-03-09 04:42:10,073 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions.
[2024-03-09 04:42:10,074 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:10,074 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions.
[2024-03-09 04:42:10,075 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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 04:42:10,077 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:10,077 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:10,078 INFO  L175             Difference]: Start difference. First operand has 124 places, 140 transitions, 459 flow. Second operand 6 states and 619 transitions.
[2024-03-09 04:42:10,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 145 transitions, 505 flow
[2024-03-09 04:42:10,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 145 transitions, 505 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:10,082 INFO  L231             Difference]: Finished difference. Result has 133 places, 140 transitions, 477 flow
[2024-03-09 04:42:10,083 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=133, PETRI_TRANSITIONS=140}
[2024-03-09 04:42:10,083 INFO  L281   CegarLoopForPetriNet]: 115 programPoint places, 18 predicate places.
[2024-03-09 04:42:10,083 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 477 flow
[2024-03-09 04:42:10,084 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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 04:42:10,084 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:10,084 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]
[2024-03-09 04:42:10,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 04:42:10,085 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:10,085 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:10,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547106573, now seen corresponding path program 1 times
[2024-03-09 04:42:10,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:10,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909553234]
[2024-03-09 04:42:10,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:10,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:10,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:10,349 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 04:42:10,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:10,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909553234]
[2024-03-09 04:42:10,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909553234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:10,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:10,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:10,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408098084]
[2024-03-09 04:42:10,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:10,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:10,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:10,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:10,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:10,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2024-03-09 04:42:10,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 477 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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 04:42:10,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:10,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2024-03-09 04:42:10,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:10,832 INFO  L124   PetriNetUnfolderBase]: 354/1289 cut-off events.
[2024-03-09 04:42:10,832 INFO  L125   PetriNetUnfolderBase]: For 427/450 co-relation queries the response was YES.
[2024-03-09 04:42:10,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 1289 events. 354/1289 cut-off events. For 427/450 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9016 event pairs, 78 based on Foata normal form. 5/1222 useless extension candidates. Maximal degree in co-relation 2865. Up to 631 conditions per place. 
[2024-03-09 04:42:10,839 INFO  L140   encePairwiseOnDemand]: 93/116 looper letters, 52 selfloop transitions, 82 changer transitions 2/221 dead transitions.
[2024-03-09 04:42:10,839 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 221 transitions, 1085 flow
[2024-03-09 04:42:10,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:10,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:10,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions.
[2024-03-09 04:42:10,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8591954022988506
[2024-03-09 04:42:10,842 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 598 transitions.
[2024-03-09 04:42:10,842 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions.
[2024-03-09 04:42:10,843 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:10,843 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions.
[2024-03-09 04:42:10,844 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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 04:42:10,845 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:10,846 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 04:42:10,846 INFO  L175             Difference]: Start difference. First operand has 133 places, 140 transitions, 477 flow. Second operand 6 states and 598 transitions.
[2024-03-09 04:42:10,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 221 transitions, 1085 flow
[2024-03-09 04:42:10,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 221 transitions, 1071 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 04:42:10,854 INFO  L231             Difference]: Finished difference. Result has 135 places, 219 transitions, 1183 flow
[2024-03-09 04:42:10,854 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1183, PETRI_PLACES=135, PETRI_TRANSITIONS=219}
[2024-03-09 04:42:10,854 INFO  L281   CegarLoopForPetriNet]: 115 programPoint places, 20 predicate places.
[2024-03-09 04:42:10,855 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 219 transitions, 1183 flow
[2024-03-09 04:42:10,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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 04:42:10,855 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:10,856 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 04:42:10,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 04:42:10,856 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:42:10,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:10,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 2053206918, now seen corresponding path program 1 times
[2024-03-09 04:42:10,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:10,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578559732]
[2024-03-09 04:42:10,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:10,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:10,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 04:42:10,881 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 04:42:10,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 04:42:10,909 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 04:42:10,909 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 04:42:10,910 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-09 04:42:10,911 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-09 04:42:10,911 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-09 04:42:10,911 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-09 04:42:10,912 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-09 04:42:10,912 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-09 04:42:10,912 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-09 04:42:10,912 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-09 04:42:10,912 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-09 04:42:10,913 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-09 04:42:10,913 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-09 04:42:10,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 04:42:10,913 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-09 04:42:10,915 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 04:42:10,915 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 04:42:10,935 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 04:42:10,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 138 places, 138 transitions, 292 flow
[2024-03-09 04:42:10,956 INFO  L124   PetriNetUnfolderBase]: 11/297 cut-off events.
[2024-03-09 04:42:10,956 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 04:42:10,957 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 309 conditions, 297 events. 11/297 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 757 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. 
[2024-03-09 04:42:10,957 INFO  L82        GeneralOperation]: Start removeDead. Operand has 138 places, 138 transitions, 292 flow
[2024-03-09 04:42:10,959 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 138 places, 138 transitions, 292 flow
[2024-03-09 04:42:10,959 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 04:42:10,960 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;@67a3088c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 04:42:10,961 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-03-09 04:42:10,967 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 04:42:10,967 INFO  L124   PetriNetUnfolderBase]: 1/25 cut-off events.
[2024-03-09 04:42:10,967 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 04:42:10,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:10,968 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]
[2024-03-09 04:42:10,968 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:10,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:10,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 1157197674, now seen corresponding path program 1 times
[2024-03-09 04:42:10,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:10,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741456095]
[2024-03-09 04:42:10,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:10,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:10,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:10,988 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 04:42:10,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:10,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741456095]
[2024-03-09 04:42:10,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741456095] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:10,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:10,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 04:42:10,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860930359]
[2024-03-09 04:42:10,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:10,990 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 04:42:10,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:10,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 04:42:10,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 04:42:11,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 138
[2024-03-09 04:42:11,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 138 transitions, 292 flow. Second operand  has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 04:42:11,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:11,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 138
[2024-03-09 04:42:11,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:11,061 INFO  L124   PetriNetUnfolderBase]: 19/533 cut-off events.
[2024-03-09 04:42:11,062 INFO  L125   PetriNetUnfolderBase]: For 30/36 co-relation queries the response was YES.
[2024-03-09 04:42:11,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 602 conditions, 533 events. 19/533 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2251 event pairs, 16 based on Foata normal form. 10/476 useless extension candidates. Maximal degree in co-relation 342. Up to 50 conditions per place. 
[2024-03-09 04:42:11,064 INFO  L140   encePairwiseOnDemand]: 132/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/134 dead transitions.
[2024-03-09 04:42:11,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 310 flow
[2024-03-09 04:42:11,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 04:42:11,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 04:42:11,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions.
[2024-03-09 04:42:11,066 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9178743961352657
[2024-03-09 04:42:11,066 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 380 transitions.
[2024-03-09 04:42:11,066 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions.
[2024-03-09 04:42:11,067 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:11,067 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions.
[2024-03-09 04:42:11,068 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 04:42:11,069 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 04:42:11,069 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 04:42:11,069 INFO  L175             Difference]: Start difference. First operand has 138 places, 138 transitions, 292 flow. Second operand 3 states and 380 transitions.
[2024-03-09 04:42:11,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 310 flow
[2024-03-09 04:42:11,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 134 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:11,071 INFO  L231             Difference]: Finished difference. Result has 139 places, 133 transitions, 286 flow
[2024-03-09 04:42:11,072 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=139, PETRI_TRANSITIONS=133}
[2024-03-09 04:42:11,072 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 1 predicate places.
[2024-03-09 04:42:11,072 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 133 transitions, 286 flow
[2024-03-09 04:42:11,073 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 04:42:11,073 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:11,073 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]
[2024-03-09 04:42:11,073 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 04:42:11,074 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:11,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:11,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 1873370718, now seen corresponding path program 1 times
[2024-03-09 04:42:11,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:11,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991144164]
[2024-03-09 04:42:11,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:11,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:11,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:11,228 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 04:42:11,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:11,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991144164]
[2024-03-09 04:42:11,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991144164] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:11,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:11,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:11,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161234413]
[2024-03-09 04:42:11,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:11,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:11,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:11,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:11,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:11,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 138
[2024-03-09 04:42:11,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 133 transitions, 286 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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 04:42:11,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:11,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 138
[2024-03-09 04:42:11,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:11,924 INFO  L124   PetriNetUnfolderBase]: 1710/5050 cut-off events.
[2024-03-09 04:42:11,924 INFO  L125   PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES.
[2024-03-09 04:42:11,929 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8117 conditions, 5050 events. 1710/5050 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 42521 event pairs, 258 based on Foata normal form. 0/4667 useless extension candidates. Maximal degree in co-relation 8082. Up to 2239 conditions per place. 
[2024-03-09 04:42:11,943 INFO  L140   encePairwiseOnDemand]: 111/138 looper letters, 46 selfloop transitions, 48 changer transitions 0/193 dead transitions.
[2024-03-09 04:42:11,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 193 transitions, 605 flow
[2024-03-09 04:42:11,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:11,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:11,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions.
[2024-03-09 04:42:11,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8490338164251208
[2024-03-09 04:42:11,945 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 703 transitions.
[2024-03-09 04:42:11,945 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions.
[2024-03-09 04:42:11,946 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:11,946 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions.
[2024-03-09 04:42:11,947 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 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 04:42:11,949 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:11,949 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:11,949 INFO  L175             Difference]: Start difference. First operand has 139 places, 133 transitions, 286 flow. Second operand 6 states and 703 transitions.
[2024-03-09 04:42:11,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 193 transitions, 605 flow
[2024-03-09 04:42:11,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 04:42:11,953 INFO  L231             Difference]: Finished difference. Result has 146 places, 181 transitions, 624 flow
[2024-03-09 04:42:11,953 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=624, PETRI_PLACES=146, PETRI_TRANSITIONS=181}
[2024-03-09 04:42:11,954 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 8 predicate places.
[2024-03-09 04:42:11,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 624 flow
[2024-03-09 04:42:11,954 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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 04:42:11,955 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:11,955 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]
[2024-03-09 04:42:11,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 04:42:11,955 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:11,955 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:11,956 INFO  L85        PathProgramCache]: Analyzing trace with hash 1079039761, now seen corresponding path program 1 times
[2024-03-09 04:42:11,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:11,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126868973]
[2024-03-09 04:42:11,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:11,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:11,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:11,987 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 04:42:11,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:11,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126868973]
[2024-03-09 04:42:11,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126868973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:11,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:11,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 04:42:11,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33351220]
[2024-03-09 04:42:11,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:11,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 04:42:11,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:11,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 04:42:11,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 04:42:12,002 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 138
[2024-03-09 04:42:12,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 624 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 04:42:12,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:12,003 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 138
[2024-03-09 04:42:12,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:12,589 INFO  L124   PetriNetUnfolderBase]: 1832/6380 cut-off events.
[2024-03-09 04:42:12,590 INFO  L125   PetriNetUnfolderBase]: For 1158/1167 co-relation queries the response was YES.
[2024-03-09 04:42:12,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11891 conditions, 6380 events. 1832/6380 cut-off events. For 1158/1167 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 61605 event pairs, 260 based on Foata normal form. 0/5990 useless extension candidates. Maximal degree in co-relation 5097. Up to 1957 conditions per place. 
[2024-03-09 04:42:12,619 INFO  L140   encePairwiseOnDemand]: 132/138 looper letters, 12 selfloop transitions, 3 changer transitions 0/182 dead transitions.
[2024-03-09 04:42:12,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 182 transitions, 661 flow
[2024-03-09 04:42:12,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 04:42:12,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 04:42:12,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions.
[2024-03-09 04:42:12,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9202898550724637
[2024-03-09 04:42:12,623 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 381 transitions.
[2024-03-09 04:42:12,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions.
[2024-03-09 04:42:12,624 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:12,624 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions.
[2024-03-09 04:42:12,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 04:42:12,627 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 04:42:12,627 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 04:42:12,628 INFO  L175             Difference]: Start difference. First operand has 146 places, 181 transitions, 624 flow. Second operand 3 states and 381 transitions.
[2024-03-09 04:42:12,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 182 transitions, 661 flow
[2024-03-09 04:42:12,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:12,641 INFO  L231             Difference]: Finished difference. Result has 146 places, 181 transitions, 639 flow
[2024-03-09 04:42:12,641 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=146, PETRI_TRANSITIONS=181}
[2024-03-09 04:42:12,641 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 8 predicate places.
[2024-03-09 04:42:12,642 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 639 flow
[2024-03-09 04:42:12,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 04:42:12,642 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:12,642 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]
[2024-03-09 04:42:12,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 04:42:12,643 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:12,643 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:12,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 410290415, now seen corresponding path program 1 times
[2024-03-09 04:42:12,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:12,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628380052]
[2024-03-09 04:42:12,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:12,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:12,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:12,704 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 04:42:12,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:12,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628380052]
[2024-03-09 04:42:12,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628380052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:12,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:12,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:12,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603438938]
[2024-03-09 04:42:12,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:12,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 04:42:12,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:12,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 04:42:12,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 04:42:12,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138
[2024-03-09 04:42:12,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 639 flow. Second operand  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 04:42:12,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:12,761 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138
[2024-03-09 04:42:12,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:13,069 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([366] L1028-5-->L1028-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][128], [Black: 157#true, 26#L1016-8true, 162#true, 63#L1016-9true, threadThread1of2ForFork0InUse, 36#L1028-6true, threadThread2of2ForFork0InUse, 159#(= |#race~datas~0| 0), 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 145#true, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-09 04:42:13,069 INFO  L294   olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event
[2024-03-09 04:42:13,069 INFO  L297   olderBase$Statistics]:   existing Event has 94 ancestors and is not cut-off event
[2024-03-09 04:42:13,069 INFO  L297   olderBase$Statistics]:   existing Event has 94 ancestors and is not cut-off event
[2024-03-09 04:42:13,069 INFO  L297   olderBase$Statistics]:   existing Event has 94 ancestors and is not cut-off event
[2024-03-09 04:42:13,084 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([366] L1028-5-->L1028-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][128], [Black: 157#true, 26#L1016-8true, 162#true, 80#L1016-10true, threadThread1of2ForFork0InUse, 36#L1028-6true, threadThread2of2ForFork0InUse, 159#(= |#race~datas~0| 0), 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 145#true, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-09 04:42:13,084 INFO  L294   olderBase$Statistics]: this new event has 95 ancestors and is not cut-off event
[2024-03-09 04:42:13,084 INFO  L297   olderBase$Statistics]:   existing Event has 95 ancestors and is not cut-off event
[2024-03-09 04:42:13,084 INFO  L297   olderBase$Statistics]:   existing Event has 95 ancestors and is not cut-off event
[2024-03-09 04:42:13,084 INFO  L297   olderBase$Statistics]:   existing Event has 95 ancestors and is not cut-off event
[2024-03-09 04:42:13,214 INFO  L124   PetriNetUnfolderBase]: 1404/4983 cut-off events.
[2024-03-09 04:42:13,215 INFO  L125   PetriNetUnfolderBase]: For 946/953 co-relation queries the response was YES.
[2024-03-09 04:42:13,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 4983 events. 1404/4983 cut-off events. For 946/953 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 45472 event pairs, 199 based on Foata normal form. 1/4740 useless extension candidates. Maximal degree in co-relation 8389. Up to 1529 conditions per place. 
[2024-03-09 04:42:13,237 INFO  L140   encePairwiseOnDemand]: 130/138 looper letters, 14 selfloop transitions, 2 changer transitions 5/187 dead transitions.
[2024-03-09 04:42:13,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 187 transitions, 693 flow
[2024-03-09 04:42:13,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:13,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:13,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions.
[2024-03-09 04:42:13,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8961352657004831
[2024-03-09 04:42:13,240 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 742 transitions.
[2024-03-09 04:42:13,240 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions.
[2024-03-09 04:42:13,241 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:13,241 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions.
[2024-03-09 04:42:13,242 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 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 04:42:13,243 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:13,244 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:13,244 INFO  L175             Difference]: Start difference. First operand has 146 places, 181 transitions, 639 flow. Second operand 6 states and 742 transitions.
[2024-03-09 04:42:13,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 187 transitions, 693 flow
[2024-03-09 04:42:13,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 187 transitions, 693 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:13,254 INFO  L231             Difference]: Finished difference. Result has 155 places, 182 transitions, 661 flow
[2024-03-09 04:42:13,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=155, PETRI_TRANSITIONS=182}
[2024-03-09 04:42:13,255 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 17 predicate places.
[2024-03-09 04:42:13,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 182 transitions, 661 flow
[2024-03-09 04:42:13,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 04:42:13,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:13,255 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]
[2024-03-09 04:42:13,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 04:42:13,256 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:13,256 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:13,256 INFO  L85        PathProgramCache]: Analyzing trace with hash -869366649, now seen corresponding path program 1 times
[2024-03-09 04:42:13,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:13,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616673461]
[2024-03-09 04:42:13,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:13,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:13,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:13,510 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 04:42:13,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:13,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616673461]
[2024-03-09 04:42:13,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616673461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:13,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:13,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:13,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227467551]
[2024-03-09 04:42:13,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:13,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:13,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:13,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:13,513 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:13,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138
[2024-03-09 04:42:13,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 182 transitions, 661 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 04:42:13,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:13,662 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138
[2024-03-09 04:42:13,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:15,532 INFO  L124   PetriNetUnfolderBase]: 6335/16691 cut-off events.
[2024-03-09 04:42:15,533 INFO  L125   PetriNetUnfolderBase]: For 6271/6813 co-relation queries the response was YES.
[2024-03-09 04:42:15,569 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38780 conditions, 16691 events. 6335/16691 cut-off events. For 6271/6813 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 169182 event pairs, 1534 based on Foata normal form. 43/15678 useless extension candidates. Maximal degree in co-relation 38701. Up to 7893 conditions per place. 
[2024-03-09 04:42:15,619 INFO  L140   encePairwiseOnDemand]: 111/138 looper letters, 104 selfloop transitions, 136 changer transitions 0/342 dead transitions.
[2024-03-09 04:42:15,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 342 transitions, 1853 flow
[2024-03-09 04:42:15,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:15,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:15,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions.
[2024-03-09 04:42:15,622 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-09 04:42:15,622 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 736 transitions.
[2024-03-09 04:42:15,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions.
[2024-03-09 04:42:15,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:15,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions.
[2024-03-09 04:42:15,624 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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 04:42:15,626 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:15,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:15,626 INFO  L175             Difference]: Start difference. First operand has 155 places, 182 transitions, 661 flow. Second operand 6 states and 736 transitions.
[2024-03-09 04:42:15,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 342 transitions, 1853 flow
[2024-03-09 04:42:15,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 342 transitions, 1841 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 04:42:15,646 INFO  L231             Difference]: Finished difference. Result has 157 places, 315 transitions, 1787 flow
[2024-03-09 04:42:15,647 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1787, PETRI_PLACES=157, PETRI_TRANSITIONS=315}
[2024-03-09 04:42:15,647 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 19 predicate places.
[2024-03-09 04:42:15,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 315 transitions, 1787 flow
[2024-03-09 04:42:15,648 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 04:42:15,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 04:42:15,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 04:42:15,649 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:15,649 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:15,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1133351838, now seen corresponding path program 1 times
[2024-03-09 04:42:15,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:15,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542987949]
[2024-03-09 04:42:15,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:15,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:15,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:15,900 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 04:42:15,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:15,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542987949]
[2024-03-09 04:42:15,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542987949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:15,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:15,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:15,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245757967]
[2024-03-09 04:42:15,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:15,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:15,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:15,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:15,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:16,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138
[2024-03-09 04:42:16,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 315 transitions, 1787 flow. Second operand  has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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 04:42:16,176 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:16,176 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138
[2024-03-09 04:42:16,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:17,899 INFO  L124   PetriNetUnfolderBase]: 6087/17101 cut-off events.
[2024-03-09 04:42:17,899 INFO  L125   PetriNetUnfolderBase]: For 17360/18213 co-relation queries the response was YES.
[2024-03-09 04:42:17,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48340 conditions, 17101 events. 6087/17101 cut-off events. For 17360/18213 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 182437 event pairs, 1095 based on Foata normal form. 26/16147 useless extension candidates. Maximal degree in co-relation 46473. Up to 6497 conditions per place. 
[2024-03-09 04:42:17,979 INFO  L140   encePairwiseOnDemand]: 123/138 looper letters, 110 selfloop transitions, 119 changer transitions 0/431 dead transitions.
[2024-03-09 04:42:17,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 431 transitions, 3113 flow
[2024-03-09 04:42:17,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:17,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:17,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions.
[2024-03-09 04:42:17,982 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756038647342995
[2024-03-09 04:42:17,982 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 725 transitions.
[2024-03-09 04:42:17,982 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions.
[2024-03-09 04:42:17,982 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:17,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions.
[2024-03-09 04:42:17,984 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 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 04:42:17,985 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:17,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:17,985 INFO  L175             Difference]: Start difference. First operand has 157 places, 315 transitions, 1787 flow. Second operand 6 states and 725 transitions.
[2024-03-09 04:42:17,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 431 transitions, 3113 flow
[2024-03-09 04:42:18,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 431 transitions, 3059 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:18,048 INFO  L231             Difference]: Finished difference. Result has 167 places, 429 transitions, 3153 flow
[2024-03-09 04:42:18,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3153, PETRI_PLACES=167, PETRI_TRANSITIONS=429}
[2024-03-09 04:42:18,049 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 29 predicate places.
[2024-03-09 04:42:18,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 429 transitions, 3153 flow
[2024-03-09 04:42:18,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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 04:42:18,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:18,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [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 04:42:18,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 04:42:18,051 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:18,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:18,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 1877665162, now seen corresponding path program 1 times
[2024-03-09 04:42:18,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:18,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053757703]
[2024-03-09 04:42:18,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:18,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:18,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:18,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 04:42:18,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:18,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053757703]
[2024-03-09 04:42:18,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053757703] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:42:18,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681964270]
[2024-03-09 04:42:18,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:18,367 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:42:18,367 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:42:18,368 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 04:42:18,378 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 04:42:18,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:18,482 INFO  L262         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjunts are in the unsatisfiable core
[2024-03-09 04:42:18,487 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:42:18,701 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 04:42:18,725 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 04:42:18,756 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 04:42:18,799 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 04:42:18,961 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:42:18,962 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 04:42:18,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-09 04:42:18,990 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:42:19,233 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_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-09 04:42:19,254 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 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|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 04:42:19,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked.
[2024-03-09 04:42:19,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681964270] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:42:19,354 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:42:19,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22
[2024-03-09 04:42:19,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967754654]
[2024-03-09 04:42:19,354 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:42:19,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-03-09 04:42:19,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:19,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-03-09 04:42:19,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=8, NotChecked=78, Total=506
[2024-03-09 04:42:19,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 77 out of 138
[2024-03-09 04:42:19,396 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 429 transitions, 3153 flow. Second operand  has 23 states, 23 states have (on average 79.30434782608695) internal successors, (1824), 23 states have internal predecessors, (1824), 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 04:42:19,396 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:19,396 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 138
[2024-03-09 04:42:19,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:23,191 INFO  L124   PetriNetUnfolderBase]: 13594/30100 cut-off events.
[2024-03-09 04:42:23,191 INFO  L125   PetriNetUnfolderBase]: For 48367/48551 co-relation queries the response was YES.
[2024-03-09 04:42:23,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99483 conditions, 30100 events. 13594/30100 cut-off events. For 48367/48551 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 307926 event pairs, 4893 based on Foata normal form. 546/29022 useless extension candidates. Maximal degree in co-relation 96150. Up to 20956 conditions per place. 
[2024-03-09 04:42:23,371 INFO  L140   encePairwiseOnDemand]: 126/138 looper letters, 372 selfloop transitions, 10 changer transitions 0/463 dead transitions.
[2024-03-09 04:42:23,371 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 463 transitions, 4179 flow
[2024-03-09 04:42:23,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 04:42:23,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 04:42:23,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 847 transitions.
[2024-03-09 04:42:23,374 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.613768115942029
[2024-03-09 04:42:23,374 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 847 transitions.
[2024-03-09 04:42:23,374 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 847 transitions.
[2024-03-09 04:42:23,375 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:23,375 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 847 transitions.
[2024-03-09 04:42:23,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 84.7) internal successors, (847), 10 states have internal predecessors, (847), 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 04:42:23,378 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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 04:42:23,379 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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 04:42:23,379 INFO  L175             Difference]: Start difference. First operand has 167 places, 429 transitions, 3153 flow. Second operand 10 states and 847 transitions.
[2024-03-09 04:42:23,379 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 463 transitions, 4179 flow
[2024-03-09 04:42:23,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 463 transitions, 4131 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-09 04:42:23,562 INFO  L231             Difference]: Finished difference. Result has 177 places, 430 transitions, 3161 flow
[2024-03-09 04:42:23,562 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3161, PETRI_PLACES=177, PETRI_TRANSITIONS=430}
[2024-03-09 04:42:23,563 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 39 predicate places.
[2024-03-09 04:42:23,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 430 transitions, 3161 flow
[2024-03-09 04:42:23,564 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 79.30434782608695) internal successors, (1824), 23 states have internal predecessors, (1824), 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 04:42:23,564 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:23,564 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1]
[2024-03-09 04:42:23,583 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 04:42:23,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:42:23,766 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:23,767 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:23,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 52043012, now seen corresponding path program 1 times
[2024-03-09 04:42:23,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:23,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102877542]
[2024-03-09 04:42:23,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:23,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:23,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:24,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-03-09 04:42:24,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:24,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102877542]
[2024-03-09 04:42:24,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102877542] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:24,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:24,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 04:42:24,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722247697]
[2024-03-09 04:42:24,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:24,078 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 04:42:24,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:24,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 04:42:24,078 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 04:42:24,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 138
[2024-03-09 04:42:24,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 430 transitions, 3161 flow. Second operand  has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 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 04:42:24,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:24,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 138
[2024-03-09 04:42:24,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:28,345 INFO  L124   PetriNetUnfolderBase]: 9718/23719 cut-off events.
[2024-03-09 04:42:28,345 INFO  L125   PetriNetUnfolderBase]: For 37010/39175 co-relation queries the response was YES.
[2024-03-09 04:42:28,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83076 conditions, 23719 events. 9718/23719 cut-off events. For 37010/39175 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 246621 event pairs, 1758 based on Foata normal form. 669/23484 useless extension candidates. Maximal degree in co-relation 78811. Up to 7811 conditions per place. 
[2024-03-09 04:42:28,514 INFO  L140   encePairwiseOnDemand]: 118/138 looper letters, 402 selfloop transitions, 224 changer transitions 0/720 dead transitions.
[2024-03-09 04:42:28,514 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 720 transitions, 6613 flow
[2024-03-09 04:42:28,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 04:42:28,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 04:42:28,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1197 transitions.
[2024-03-09 04:42:28,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7885375494071146
[2024-03-09 04:42:28,518 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1197 transitions.
[2024-03-09 04:42:28,518 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1197 transitions.
[2024-03-09 04:42:28,519 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:28,519 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1197 transitions.
[2024-03-09 04:42:28,521 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 108.81818181818181) internal successors, (1197), 11 states have internal predecessors, (1197), 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 04:42:28,522 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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 04:42:28,523 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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 04:42:28,523 INFO  L175             Difference]: Start difference. First operand has 177 places, 430 transitions, 3161 flow. Second operand 11 states and 1197 transitions.
[2024-03-09 04:42:28,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 720 transitions, 6613 flow
[2024-03-09 04:42:28,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 720 transitions, 6577 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-09 04:42:28,791 INFO  L231             Difference]: Finished difference. Result has 189 places, 556 transitions, 5149 flow
[2024-03-09 04:42:28,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=3141, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5149, PETRI_PLACES=189, PETRI_TRANSITIONS=556}
[2024-03-09 04:42:28,792 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 51 predicate places.
[2024-03-09 04:42:28,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 556 transitions, 5149 flow
[2024-03-09 04:42:28,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 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 04:42:28,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:28,793 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1]
[2024-03-09 04:42:28,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 04:42:28,794 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:28,794 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:28,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -722638215, now seen corresponding path program 1 times
[2024-03-09 04:42:28,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:28,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913842615]
[2024-03-09 04:42:28,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:28,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:28,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:29,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-09 04:42:29,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:29,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913842615]
[2024-03-09 04:42:29,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913842615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:29,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:42:29,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:42:29,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205667565]
[2024-03-09 04:42:29,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:29,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:42:29,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:29,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:42:29,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:42:29,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138
[2024-03-09 04:42:29,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 556 transitions, 5149 flow. Second operand  has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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 04:42:29,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:29,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138
[2024-03-09 04:42:29,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:35,251 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L1016-6-->L1016-7: Formula: (= (store |v_#race_42| v_~datas~0.base_4 (store (select |v_#race_42| v_~datas~0.base_4) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_4) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_41|)  InVars {#race=|v_#race_42|, ~datas~0.base=v_~datas~0.base_4, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9}  OutVars{#race=|v_#race_41|, ~datas~0.base=v_~datas~0.base_4, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9}  AuxVars[]  AssignedVars[#race][877], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 145#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 174#true, 185#true, 39#L1016-7true, Black: 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 157#true, Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), 159#(= |#race~datas~0| 0), 10#L1016-11true, 57#main_returnLabel#1true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 613#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)))])
[2024-03-09 04:42:35,252 INFO  L294   olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event
[2024-03-09 04:42:35,252 INFO  L297   olderBase$Statistics]:   existing Event has 104 ancestors and is not cut-off event
[2024-03-09 04:42:35,252 INFO  L297   olderBase$Statistics]:   existing Event has 104 ancestors and is not cut-off event
[2024-03-09 04:42:35,252 INFO  L297   olderBase$Statistics]:   existing Event has 104 ancestors and is not cut-off event
[2024-03-09 04:42:36,114 INFO  L124   PetriNetUnfolderBase]: 20318/45625 cut-off events.
[2024-03-09 04:42:36,114 INFO  L125   PetriNetUnfolderBase]: For 155105/157170 co-relation queries the response was YES.
[2024-03-09 04:42:36,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 183263 conditions, 45625 events. 20318/45625 cut-off events. For 155105/157170 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 502476 event pairs, 2754 based on Foata normal form. 210/43495 useless extension candidates. Maximal degree in co-relation 178839. Up to 23694 conditions per place. 
[2024-03-09 04:42:36,555 INFO  L140   encePairwiseOnDemand]: 111/138 looper letters, 421 selfloop transitions, 499 changer transitions 5/1062 dead transitions.
[2024-03-09 04:42:36,555 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1062 transitions, 11611 flow
[2024-03-09 04:42:36,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:42:36,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:42:36,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions.
[2024-03-09 04:42:36,558 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8840579710144928
[2024-03-09 04:42:36,558 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 732 transitions.
[2024-03-09 04:42:36,558 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 732 transitions.
[2024-03-09 04:42:36,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:36,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 732 transitions.
[2024-03-09 04:42:36,559 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 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 04:42:36,561 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:36,561 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 04:42:36,561 INFO  L175             Difference]: Start difference. First operand has 189 places, 556 transitions, 5149 flow. Second operand 6 states and 732 transitions.
[2024-03-09 04:42:36,561 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1062 transitions, 11611 flow
[2024-03-09 04:42:38,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1062 transitions, 11543 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-03-09 04:42:38,370 INFO  L231             Difference]: Finished difference. Result has 195 places, 996 transitions, 10981 flow
[2024-03-09 04:42:38,370 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=5105, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10981, PETRI_PLACES=195, PETRI_TRANSITIONS=996}
[2024-03-09 04:42:38,370 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 57 predicate places.
[2024-03-09 04:42:38,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 996 transitions, 10981 flow
[2024-03-09 04:42:38,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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 04:42:38,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:42:38,371 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 04:42:38,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 04:42:38,371 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:42:38,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:42:38,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 581873621, now seen corresponding path program 1 times
[2024-03-09 04:42:38,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:42:38,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624207207]
[2024-03-09 04:42:38,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:38,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:42:38,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:38,813 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 04:42:38,813 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:42:38,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624207207]
[2024-03-09 04:42:38,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624207207] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:42:38,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425164414]
[2024-03-09 04:42:38,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:42:38,813 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:42:38,813 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:42:38,814 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 04:42:38,825 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 04:42:38,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:42:38,917 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 04:42:38,924 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:42:38,954 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 04:42:39,019 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:42:39,020 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 15 treesize of output 15
[2024-03-09 04:42:39,185 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 04:42:39,186 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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 04:42:39,241 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 04:42:39,270 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 15 treesize of output 11
[2024-03-09 04:42:39,282 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 28 treesize of output 27
[2024-03-09 04:42:39,298 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:42:39,298 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 04:42:39,316 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:42:39,317 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 04:42:39,350 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 56 treesize of output 45
[2024-03-09 04:42:39,364 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 04:42:39,364 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 04:42:39,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [425164414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:42:39,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 04:42:39,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 20
[2024-03-09 04:42:39,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391627530]
[2024-03-09 04:42:39,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:42:39,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-09 04:42:39,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:42:39,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-09 04:42:39,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420
[2024-03-09 04:42:40,665 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 138
[2024-03-09 04:42:40,666 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 996 transitions, 10981 flow. Second operand  has 14 states, 14 states have (on average 83.28571428571429) internal successors, (1166), 14 states have internal predecessors, (1166), 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 04:42:40,666 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:42:40,666 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 138
[2024-03-09 04:42:40,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:42:56,391 INFO  L124   PetriNetUnfolderBase]: 39242/82744 cut-off events.
[2024-03-09 04:42:56,392 INFO  L125   PetriNetUnfolderBase]: For 418691/421074 co-relation queries the response was YES.
[2024-03-09 04:42:56,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 397473 conditions, 82744 events. 39242/82744 cut-off events. For 418691/421074 co-relation queries the response was YES. Maximal size of possible extension queue 3488. Compared 950188 event pairs, 5053 based on Foata normal form. 777/82253 useless extension candidates. Maximal degree in co-relation 382698. Up to 34694 conditions per place. 
[2024-03-09 04:42:57,387 INFO  L140   encePairwiseOnDemand]: 96/138 looper letters, 1467 selfloop transitions, 603 changer transitions 11/2170 dead transitions.
[2024-03-09 04:42:57,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 2170 transitions, 29195 flow
[2024-03-09 04:42:57,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 04:42:57,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 04:42:57,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1795 transitions.
[2024-03-09 04:42:57,391 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6845919145690312
[2024-03-09 04:42:57,391 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1795 transitions.
[2024-03-09 04:42:57,391 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1795 transitions.
[2024-03-09 04:42:57,392 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:42:57,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1795 transitions.
[2024-03-09 04:42:57,395 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 94.47368421052632) internal successors, (1795), 19 states have internal predecessors, (1795), 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 04:42:57,398 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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 04:42:57,398 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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 04:42:57,398 INFO  L175             Difference]: Start difference. First operand has 195 places, 996 transitions, 10981 flow. Second operand 19 states and 1795 transitions.
[2024-03-09 04:42:57,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 2170 transitions, 29195 flow
[2024-03-09 04:43:05,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2170 transitions, 28815 flow, removed 190 selfloop flow, removed 0 redundant places.
[2024-03-09 04:43:05,791 INFO  L231             Difference]: Finished difference. Result has 224 places, 1510 transitions, 20089 flow
[2024-03-09 04:43:05,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=10813, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=20089, PETRI_PLACES=224, PETRI_TRANSITIONS=1510}
[2024-03-09 04:43:05,792 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 86 predicate places.
[2024-03-09 04:43:05,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 1510 transitions, 20089 flow
[2024-03-09 04:43:05,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 83.28571428571429) internal successors, (1166), 14 states have internal predecessors, (1166), 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 04:43:05,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:43:05,793 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 04:43:05,801 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 04:43:05,994 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,SelfDestructingSolverStorable15
[2024-03-09 04:43:05,994 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:43:05,995 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:43:05,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -1226954729, now seen corresponding path program 2 times
[2024-03-09 04:43:05,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:43:05,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944742740]
[2024-03-09 04:43:05,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:43:05,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:43:06,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:43:06,548 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 04:43:06,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:43:06,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944742740]
[2024-03-09 04:43:06,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944742740] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:43:06,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737061080]
[2024-03-09 04:43:06,548 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 04:43:06,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:43:06,549 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:43:06,550 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 04:43:06,551 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 04:43:06,767 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 04:43:06,767 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:43:06,769 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 04:43:06,777 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:43:06,817 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 04:43:06,909 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:43:06,910 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 15 treesize of output 15
[2024-03-09 04:43:07,316 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 04:43:07,316 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-03-09 04:43:07,325 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:43:07,325 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 24 treesize of output 11
[2024-03-09 04:43:07,821 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:43:07,821 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 04:43:07,836 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:43:07,837 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 16 treesize of output 11
[2024-03-09 04:43:07,855 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 04:43:07,863 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 04:43:07,958 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 04:43:08,004 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 04:43:08,062 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 04:43:08,149 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 04:43:08,238 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41
[2024-03-09 04:43:08,288 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 04:43:08,289 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:43:10,666 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_threadThread1of2ForFork0_#in~arg.base| |c_threadThread1of2ForFork0_#in~arg.offset|))) (let ((.cse1 (* (div .cse4 2) 4)) (.cse0 (forall ((v_ArrVal_603 (Array Int Int))) (not (= c_~datas~0.base (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_603) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse3 (= (mod .cse4 2) 0)) (.cse2 (+ |c_threadThread1of2ForFork0_#in~arg.base| |c_threadThread1of2ForFork0_#in~arg.offset| 1))) (and (or (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ .cse1 c_~datas~0.offset) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse1 c_~datas~0.offset 3)))) .cse0) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ .cse1 c_~datas~0.offset 1) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ .cse1 c_~datas~0.offset 2) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0)) (and (<= .cse2 0) (not .cse3))) (or (and (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse1 c_~datas~0.offset 4)))) .cse0) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ 7 .cse1 c_~datas~0.offset)))) .cse0) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ .cse1 c_~datas~0.offset 6) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse1 5 c_~datas~0.offset)))) .cse0)) .cse3 (< 0 .cse2))))) is different from false
[2024-03-09 04:43:10,818 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* (div |c_ULTIMATE.start_main_~i~1#1| 2) 4)) (.cse3 (forall ((v_ArrVal_603 (Array Int Int))) (not (= c_~datas~0.base (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_603) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (= (mod |c_ULTIMATE.start_main_~i~1#1| 2) 0))) (and (or (< 0 .cse0) .cse1 (and (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse2 4) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse3) (or .cse3 (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ 7 c_~datas~0.offset .cse2) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse3 (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse2 6) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ 5 c_~datas~0.offset .cse2) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse3))) (or (and (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse2)))) .cse3) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse2 2) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse3) (or .cse3 (forall ((v_ArrVal_604 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse2 1))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse2 3) (select (select (store |c_#memory_$Pointer$.offset| c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse3)) (and (<= .cse0 0) (not .cse1))))) is different from false
[2024-03-09 04:43:11,608 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (* (div |c_ULTIMATE.start_main_~i~1#1| 2) 4)) (.cse2 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_601) c_~datas~0.base v_ArrVal_603) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base)))) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (= (mod |c_ULTIMATE.start_main_~i~1#1| 2) 0))) (and (or (and (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse0 3) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse2) (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse0 1)))) .cse2) (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse0)))) .cse2) (or .cse2 (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (+ c_~datas~0.offset .cse0 2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (<= .cse3 0) (not .cse4))) (or (and (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse0 4)))) .cse2) (or .cse2 (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ 5 c_~datas~0.offset .cse0))))) (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ c_~datas~0.offset .cse0 6)))) .cse2) (or (forall ((v_ArrVal_602 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (not (= (+ 7 c_~datas~0.offset .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_602) c_~datas~0.base v_ArrVal_604) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse2)) (< 0 .cse3) .cse4)))) is different from false
[2024-03-09 04:43:12,603 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 566 treesize of output 442
[2024-03-09 04:43:12,625 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 622 treesize of output 594
[2024-03-09 04:43:12,646 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 04:43:12,656 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 04:43:12,666 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 04:43:12,672 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 04:43:12,732 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 04:43:12,738 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 04:43:12,744 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 48
[2024-03-09 04:43:12,749 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 48 treesize of output 46
[2024-03-09 04:43:12,814 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 04:43:12,825 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 04:43:12,842 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 04:43:12,850 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 04:43:12,931 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 04:43:12,941 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 04:43:12,951 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 48
[2024-03-09 04:43:12,961 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 48 treesize of output 46
[2024-03-09 04:43:13,327 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:43:13,328 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163
[2024-03-09 04:43:13,567 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 04:43:13,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [737061080] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:43:13,567 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:43:13,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 21] total 51
[2024-03-09 04:43:13,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177150776]
[2024-03-09 04:43:13,568 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:43:13,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-03-09 04:43:13,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:43:13,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-03-09 04:43:13,570 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2033, Unknown=37, NotChecked=288, Total=2652
[2024-03-09 04:43:14,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 138
[2024-03-09 04:43:14,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1510 transitions, 20089 flow. Second operand  has 52 states, 52 states have (on average 55.48076923076923) internal successors, (2885), 52 states have internal predecessors, (2885), 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 04:43:14,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:43:14,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 138
[2024-03-09 04:43:14,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:44:20,730 INFO  L124   PetriNetUnfolderBase]: 113748/212450 cut-off events.
[2024-03-09 04:44:20,730 INFO  L125   PetriNetUnfolderBase]: For 1426748/1427969 co-relation queries the response was YES.
[2024-03-09 04:44:22,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1118093 conditions, 212450 events. 113748/212450 cut-off events. For 1426748/1427969 co-relation queries the response was YES. Maximal size of possible extension queue 7002. Compared 2424756 event pairs, 17145 based on Foata normal form. 1312/212362 useless extension candidates. Maximal degree in co-relation 1116439. Up to 53946 conditions per place. 
[2024-03-09 04:44:23,387 INFO  L140   encePairwiseOnDemand]: 106/138 looper letters, 3700 selfloop transitions, 1770 changer transitions 79/5604 dead transitions.
[2024-03-09 04:44:23,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 5604 transitions, 84753 flow
[2024-03-09 04:44:23,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2024-03-09 04:44:23,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2024-03-09 04:44:23,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3187 transitions.
[2024-03-09 04:44:23,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4913660191181005
[2024-03-09 04:44:23,395 INFO  L72            ComplementDD]: Start complementDD. Operand 47 states and 3187 transitions.
[2024-03-09 04:44:23,395 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 3187 transitions.
[2024-03-09 04:44:23,396 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:44:23,396 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3187 transitions.
[2024-03-09 04:44:23,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 48 states, 47 states have (on average 67.80851063829788) internal successors, (3187), 47 states have internal predecessors, (3187), 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 04:44:23,407 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 48 states, 48 states have (on average 138.0) internal successors, (6624), 48 states have internal predecessors, (6624), 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 04:44:23,408 INFO  L81            ComplementDD]: Finished complementDD. Result  has 48 states, 48 states have (on average 138.0) internal successors, (6624), 48 states have internal predecessors, (6624), 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 04:44:23,408 INFO  L175             Difference]: Start difference. First operand has 224 places, 1510 transitions, 20089 flow. Second operand 47 states and 3187 transitions.
[2024-03-09 04:44:23,409 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 5604 transitions, 84753 flow
[2024-03-09 04:44:55,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 5604 transitions, 84691 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-03-09 04:44:55,569 INFO  L231             Difference]: Finished difference. Result has 282 places, 2869 transitions, 49187 flow
[2024-03-09 04:44:55,570 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=20063, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=476, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=49187, PETRI_PLACES=282, PETRI_TRANSITIONS=2869}
[2024-03-09 04:44:55,571 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 144 predicate places.
[2024-03-09 04:44:55,571 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 2869 transitions, 49187 flow
[2024-03-09 04:44:55,572 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 55.48076923076923) internal successors, (2885), 52 states have internal predecessors, (2885), 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 04:44:55,572 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:44:55,572 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 04:44:55,577 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 04:44:55,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:44:55,778 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:44:55,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:44:55,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -1089291037, now seen corresponding path program 3 times
[2024-03-09 04:44:55,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:44:55,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527891860]
[2024-03-09 04:44:55,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:44:55,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:44:55,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:44:56,414 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 04:44:56,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:44:56,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527891860]
[2024-03-09 04:44:56,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527891860] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:44:56,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86190972]
[2024-03-09 04:44:56,415 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 04:44:56,415 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:44:56,415 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:44:56,416 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 04:44:56,420 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 04:44:56,560 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 04:44:56,561 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:44:56,562 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-09 04:44:56,568 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:44:56,612 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 04:44:56,705 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:44:56,705 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 15 treesize of output 15
[2024-03-09 04:44:56,928 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 04:44:56,928 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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 04:44:57,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:44:57,003 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 04:44:57,025 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 15 treesize of output 11
[2024-03-09 04:44:57,076 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 28 treesize of output 27
[2024-03-09 04:44:57,137 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:44:57,137 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 04:44:57,336 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 04:44:57,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:44:57,407 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 44 treesize of output 35
[2024-03-09 04:44:57,445 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:44:57,446 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 04:44:57,518 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:44:57,518 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 56 treesize of output 45
[2024-03-09 04:44:57,538 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:44:57,539 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 56 treesize of output 45
[2024-03-09 04:44:57,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:44:57,567 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 56 treesize of output 45
[2024-03-09 04:44:57,620 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 56 treesize of output 45
[2024-03-09 04:44:57,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:44:57,632 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 04:44:57,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [86190972] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:44:57,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 04:44:57,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 04:44:57,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720062935]
[2024-03-09 04:44:57,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:44:57,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 04:44:57,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:44:57,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 04:44:57,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-09 04:44:58,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 138
[2024-03-09 04:44:58,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 2869 transitions, 49187 flow. Second operand  has 15 states, 15 states have (on average 83.13333333333334) internal successors, (1247), 15 states have internal predecessors, (1247), 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 04:44:58,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:44:58,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 138
[2024-03-09 04:44:58,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:45:19,486 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L1030-1-->L1030-2: Formula: (= (store |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19| (store (select |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19|) |v_ULTIMATE.start_main_~#tids~0#1.offset_19| 0)) |v_#race_31|)  InVars {#race=|v_#race_32|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  OutVars{#race=|v_#race_31|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  AuxVars[]  AssignedVars[#race][1849], [Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 613#true, Black: 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 649#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 648#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 1455#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 650#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 909#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 913#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 185#true, Black: 911#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 901#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 670#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 895#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 899#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 145#true, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 905#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 903#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 907#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 897#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 157#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), 10#L1016-11true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 1465#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1434#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 174#true, Black: 1482#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1444#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1442#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1463#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1428#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1475#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1469#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1165#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 1461#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1473#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1467#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1471#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1479#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1477#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 159#(= |#race~datas~0| 0), 719#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|), 645#true, 78#L1030-2true, 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 55#L1016-11true, Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1760#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|))])
[2024-03-09 04:45:19,487 INFO  L294   olderBase$Statistics]: this new event has 96 ancestors and is cut-off event
[2024-03-09 04:45:19,487 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is cut-off event
[2024-03-09 04:45:19,487 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is cut-off event
[2024-03-09 04:45:19,487 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is cut-off event
[2024-03-09 04:45:29,872 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L1030-1-->L1030-2: Formula: (= (store |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19| (store (select |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19|) |v_ULTIMATE.start_main_~#tids~0#1.offset_19| 0)) |v_#race_31|)  InVars {#race=|v_#race_32|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  OutVars{#race=|v_#race_31|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  AuxVars[]  AssignedVars[#race][729], [Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 613#true, Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 649#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 648#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), Black: 650#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 909#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 913#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 185#true, Black: 911#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 901#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 670#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 895#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 145#true, Black: 899#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 905#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 903#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 907#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 897#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 157#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 107#L1017true, 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1428#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1465#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1434#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 174#true, Black: 1482#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1444#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1442#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1463#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1475#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1469#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1455#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1165#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 1461#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1473#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1467#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1471#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1479#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1477#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 1742#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 159#(= |#race~datas~0| 0), 719#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|), 645#true, 78#L1030-2true, Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 55#L1016-11true, Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)))])
[2024-03-09 04:45:29,872 INFO  L294   olderBase$Statistics]: this new event has 98 ancestors and is cut-off event
[2024-03-09 04:45:29,872 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is cut-off event
[2024-03-09 04:45:29,873 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is cut-off event
[2024-03-09 04:45:29,873 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is cut-off event
[2024-03-09 04:45:29,927 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([328] L1030-1-->L1030-2: Formula: (= (store |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19| (store (select |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19|) |v_ULTIMATE.start_main_~#tids~0#1.offset_19| 0)) |v_#race_31|)  InVars {#race=|v_#race_32|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  OutVars{#race=|v_#race_31|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  AuxVars[]  AssignedVars[#race][1849], [Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 613#true, Black: 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 649#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 648#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 1455#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 650#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 909#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 913#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 185#true, Black: 911#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 901#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 670#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 895#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 899#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 145#true, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 905#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 903#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 907#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 897#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 157#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), 10#L1016-11true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 1465#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1434#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 174#true, Black: 1482#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1444#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1442#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1463#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1428#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1475#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1469#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1165#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 1461#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1473#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1467#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1471#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1479#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1477#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 159#(= |#race~datas~0| 0), 719#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|), 645#true, 78#L1030-2true, 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 55#L1016-11true, Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1760#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|))])
[2024-03-09 04:45:29,928 INFO  L294   olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event
[2024-03-09 04:45:29,928 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is not cut-off event
[2024-03-09 04:45:29,928 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is not cut-off event
[2024-03-09 04:45:29,928 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is not cut-off event
[2024-03-09 04:45:29,928 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is not cut-off event
[2024-03-09 04:45:37,811 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([328] L1030-1-->L1030-2: Formula: (= (store |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19| (store (select |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19|) |v_ULTIMATE.start_main_~#tids~0#1.offset_19| 0)) |v_#race_31|)  InVars {#race=|v_#race_32|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  OutVars{#race=|v_#race_31|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  AuxVars[]  AssignedVars[#race][729], [Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 613#true, Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 649#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 648#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), Black: 650#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 909#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 913#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 185#true, Black: 911#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 901#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 670#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 895#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 145#true, Black: 899#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 905#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 903#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 907#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 897#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 157#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 107#L1017true, 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1428#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1465#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1434#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 174#true, Black: 1482#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1444#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1442#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1463#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1475#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1469#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1455#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1165#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 1461#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1473#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1467#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1471#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1479#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1477#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 1742#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 159#(= |#race~datas~0| 0), 719#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|), 645#true, 78#L1030-2true, Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 55#L1016-11true, Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)))])
[2024-03-09 04:45:37,811 INFO  L294   olderBase$Statistics]: this new event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,811 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,811 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,811 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,811 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,890 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L1030-1-->L1030-2: Formula: (= (store |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19| (store (select |v_#race_32| |v_ULTIMATE.start_main_~#tids~0#1.base_19|) |v_ULTIMATE.start_main_~#tids~0#1.offset_19| 0)) |v_#race_31|)  InVars {#race=|v_#race_32|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  OutVars{#race=|v_#race_31|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_19|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_19|}  AuxVars[]  AssignedVars[#race][262], [Black: 634#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 613#true, Black: 628#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 622#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 649#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 648#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), Black: 650#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), 1455#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 647#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 909#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 147#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 913#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 185#true, Black: 911#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 901#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 670#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 895#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 899#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 145#true, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 905#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 149#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 903#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 150#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 907#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 897#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 157#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), 10#L1016-11true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 176#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 187#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 1465#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1434#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 174#true, Black: 1482#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1444#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 69#L1017true, Black: 1442#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1463#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1428#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1475#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1469#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1165#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 1461#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1473#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1467#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1471#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1479#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1477#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 599#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 603#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 2) 0)), Black: 601#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) 1) 0)), Black: 597#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 159#(= |#race~datas~0| 0), 719#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|), 645#true, 78#L1030-2true, 636#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 632#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1760#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)))])
[2024-03-09 04:45:37,891 INFO  L294   olderBase$Statistics]: this new event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,891 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,891 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:45:37,891 INFO  L297   olderBase$Statistics]:   existing Event has 98 ancestors and is not cut-off event
[2024-03-09 04:46:04,541 INFO  L124   PetriNetUnfolderBase]: 78142/164114 cut-off events.
[2024-03-09 04:46:04,541 INFO  L125   PetriNetUnfolderBase]: For 1987794/1993869 co-relation queries the response was YES.
[2024-03-09 04:46:06,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1016822 conditions, 164114 events. 78142/164114 cut-off events. For 1987794/1993869 co-relation queries the response was YES. Maximal size of possible extension queue 6439. Compared 2046081 event pairs, 8539 based on Foata normal form. 2493/163549 useless extension candidates. Maximal degree in co-relation 1015415. Up to 60552 conditions per place. 
[2024-03-09 04:46:06,951 INFO  L140   encePairwiseOnDemand]: 110/138 looper letters, 2259 selfloop transitions, 1933 changer transitions 33/4328 dead transitions.
[2024-03-09 04:46:06,951 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 4328 transitions, 80068 flow
[2024-03-09 04:46:06,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-09 04:46:06,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-09 04:46:06,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2470 transitions.
[2024-03-09 04:46:06,954 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6884057971014492
[2024-03-09 04:46:06,954 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 2470 transitions.
[2024-03-09 04:46:06,954 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 2470 transitions.
[2024-03-09 04:46:06,954 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:46:06,954 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2470 transitions.
[2024-03-09 04:46:06,957 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 95.0) internal successors, (2470), 26 states have internal predecessors, (2470), 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 04:46:06,974 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 138.0) internal successors, (3726), 27 states have internal predecessors, (3726), 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 04:46:06,974 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 138.0) internal successors, (3726), 27 states have internal predecessors, (3726), 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 04:46:06,974 INFO  L175             Difference]: Start difference. First operand has 282 places, 2869 transitions, 49187 flow. Second operand 26 states and 2470 transitions.
[2024-03-09 04:46:06,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 4328 transitions, 80068 flow
[2024-03-09 04:47:00,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 4328 transitions, 79599 flow, removed 224 selfloop flow, removed 9 redundant places.
[2024-03-09 04:47:00,983 INFO  L231             Difference]: Finished difference. Result has 309 places, 3563 transitions, 69121 flow
[2024-03-09 04:47:00,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=48876, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=69121, PETRI_PLACES=309, PETRI_TRANSITIONS=3563}
[2024-03-09 04:47:00,984 INFO  L281   CegarLoopForPetriNet]: 138 programPoint places, 171 predicate places.
[2024-03-09 04:47:00,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 3563 transitions, 69121 flow
[2024-03-09 04:47:00,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 83.13333333333334) internal successors, (1247), 15 states have internal predecessors, (1247), 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 04:47:00,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:47:00,985 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 04:47:00,990 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 04:47:01,185 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,SelfDestructingSolverStorable17
[2024-03-09 04:47:01,186 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 04:47:01,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:47:01,187 INFO  L85        PathProgramCache]: Analyzing trace with hash -1932534467, now seen corresponding path program 4 times
[2024-03-09 04:47:01,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:47:01,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252568010]
[2024-03-09 04:47:01,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:47:01,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:47:01,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:47:01,790 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 04:47:01,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:47:01,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252568010]
[2024-03-09 04:47:01,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252568010] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:47:01,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23338111]
[2024-03-09 04:47:01,791 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 04:47:01,791 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:47:01,791 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:47:01,792 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 04:47:01,796 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 04:47:01,988 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 04:47:01,988 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:47:01,990 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 66 conjunts are in the unsatisfiable core
[2024-03-09 04:47:02,015 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:47:02,061 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 04:47:02,159 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:47:02,160 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 15 treesize of output 15
[2024-03-09 04:47:02,616 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 04:47:02,617 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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 04:47:02,624 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:02,626 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 16 treesize of output 11
[2024-03-09 04:47:02,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:02,944 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 04:47:02,958 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:02,959 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 16 treesize of output 11
[2024-03-09 04:47:02,997 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 04:47:03,258 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 04:47:03,266 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 04:47:03,326 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 04:47:03,394 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 04:47:03,479 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 04:47:03,579 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:03,580 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 04:47:03,625 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:03,627 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 04:47:03,672 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:03,673 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 04:47:03,710 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:47:03,711 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 04:47:03,826 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41
[2024-03-09 04:47:03,875 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 04:47:03,875 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:47:21,706 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse9 (+ c_~datas~0.offset .cse5 1)) (.cse7 (+ c_~datas~0.offset 2 .cse5)) (.cse3 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_815 (Array Int Int)) (v_ArrVal_817 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_815))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_817))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_815 (Array Int Int)) (v_ArrVal_817 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_815))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_817))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))) (forall ((v_ArrVal_815 (Array Int Int)) (v_ArrVal_817 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_815))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_817))) c_~datas~0.base) .cse7))) (forall ((v_ArrVal_815 (Array Int Int)) (v_ArrVal_817 Int)) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_815))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_817))) c_~datas~0.base) .cse9) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false
[2024-03-09 04:47:23,201 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,202 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 110 treesize of output 90
[2024-03-09 04:47:23,226 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,227 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 523 treesize of output 469
[2024-03-09 04:47:23,245 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 279 treesize of output 251
[2024-03-09 04:47:23,352 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,353 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 60
[2024-03-09 04:47:23,400 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,401 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 90
[2024-03-09 04:47:23,411 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:47:23,433 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:47:23,434 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 157
[2024-03-09 04:47:23,450 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 71 treesize of output 64
[2024-03-09 04:47:23,460 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 110
[2024-03-09 04:47:23,523 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,523 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 89
[2024-03-09 04:47:23,532 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:47:23,557 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:47:23,558 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 189
[2024-03-09 04:47:23,576 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 68 treesize of output 62
[2024-03-09 04:47:23,590 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 110
[2024-03-09 04:47:23,649 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:23,650 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 90
[2024-03-09 04:47:23,657 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:47:23,678 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:47:23,679 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 157
[2024-03-09 04:47:23,693 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 71 treesize of output 64
[2024-03-09 04:47:23,706 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 110
[2024-03-09 04:47:33,435 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 310 treesize of output 258
[2024-03-09 04:47:33,452 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 237 treesize of output 233
[2024-03-09 04:47:33,463 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 294 treesize of output 274
[2024-03-09 04:47:33,482 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 20 treesize of output 18
[2024-03-09 04:47:33,572 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 34 treesize of output 30
[2024-03-09 04:47:33,581 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 20 treesize of output 18
[2024-03-09 04:47:33,651 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 34 treesize of output 30
[2024-03-09 04:47:33,659 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 20 treesize of output 18
[2024-03-09 04:47:33,727 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 34 treesize of output 30
[2024-03-09 04:47:33,737 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 20 treesize of output 18
[2024-03-09 04:47:34,275 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:47:34,275 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 159
[2024-03-09 04:47:34,756 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 04:47:34,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [23338111] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:47:34,756 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:47:34,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 21] total 52
[2024-03-09 04:47:34,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040640346]
[2024-03-09 04:47:34,757 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:47:34,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2024-03-09 04:47:34,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:47:34,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-03-09 04:47:34,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2289, Unknown=82, NotChecked=100, Total=2756
[2024-03-09 04:47:36,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 138
[2024-03-09 04:47:36,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 3563 transitions, 69121 flow. Second operand  has 53 states, 53 states have (on average 55.43396226415094) internal successors, (2938), 53 states have internal predecessors, (2938), 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 04:47:36,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:47:36,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 138
[2024-03-09 04:47:36,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:50:51,886 INFO  L124   PetriNetUnfolderBase]: 146215/272477 cut-off events.
[2024-03-09 04:50:51,886 INFO  L125   PetriNetUnfolderBase]: For 4589087/4591114 co-relation queries the response was YES.
[2024-03-09 04:50:55,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1858681 conditions, 272477 events. 146215/272477 cut-off events. For 4589087/4591114 co-relation queries the response was YES. Maximal size of possible extension queue 9007. Compared 3184570 event pairs, 20874 based on Foata normal form. 1774/272713 useless extension candidates. Maximal degree in co-relation 1854660. Up to 99033 conditions per place. 
[2024-03-09 04:50:56,761 INFO  L140   encePairwiseOnDemand]: 102/138 looper letters, 4431 selfloop transitions, 2639 changer transitions 132/7257 dead transitions.
[2024-03-09 04:50:56,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 7257 transitions, 145566 flow
[2024-03-09 04:50:56,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. 
[2024-03-09 04:50:56,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2024-03-09 04:50:56,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3269 transitions.
[2024-03-09 04:50:56,766 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4935084541062802
[2024-03-09 04:50:56,766 INFO  L72            ComplementDD]: Start complementDD. Operand 48 states and 3269 transitions.
[2024-03-09 04:50:56,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 48 states and 3269 transitions.
[2024-03-09 04:50:56,766 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:50:56,766 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3269 transitions.
[2024-03-09 04:50:56,770 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 49 states, 48 states have (on average 68.10416666666667) internal successors, (3269), 48 states have internal predecessors, (3269), 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 04:50:56,775 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 49 states, 49 states have (on average 138.0) internal successors, (6762), 49 states have internal predecessors, (6762), 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 04:50:56,775 INFO  L81            ComplementDD]: Finished complementDD. Result  has 49 states, 49 states have (on average 138.0) internal successors, (6762), 49 states have internal predecessors, (6762), 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 04:50:56,775 INFO  L175             Difference]: Start difference. First operand has 309 places, 3563 transitions, 69121 flow. Second operand 48 states and 3269 transitions.
[2024-03-09 04:50:56,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 7257 transitions, 145566 flow
Killed by 15
