./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a1634bb3c8fd20e3116589f39b7439eb06d3d5864b5afee415eff1cf39cd7c4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 21:29:16,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:29:16,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 21:29:16,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:29:16,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:29:16,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:29:16,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:29:16,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:29:16,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:29:16,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:29:16,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:29:16,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:29:16,310 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:29:16,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:29:16,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:29:16,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:29:16,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:29:16,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:29:16,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:29:16,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:29:16,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:29:16,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:29:16,328 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 21:29:16,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:29:16,328 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:29:16,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:29:16,329 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:29:16,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:29:16,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:29:16,329 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 21:29:16,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:29:16,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:29:16,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:29:16,331 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 21:29:16,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 21:29:16,331 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:29:16,331 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 21:29:16,331 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 21:29:16,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> GemCutter 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 -> 3a1634bb3c8fd20e3116589f39b7439eb06d3d5864b5afee415eff1cf39cd7c4 [2023-11-21 21:29:16,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:29:16,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:29:16,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:29:16,565 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:29:16,566 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:29:16,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i [2023-11-21 21:29:17,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:29:17,750 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:29:17,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i [2023-11-21 21:29:17,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e3f6dc887/f521b22e469242fa9b4f5b4a87d7e1cf/FLAG790cdb20a [2023-11-21 21:29:17,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e3f6dc887/f521b22e469242fa9b4f5b4a87d7e1cf [2023-11-21 21:29:17,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:29:17,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:29:17,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:29:17,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:29:17,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:29:17,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:29:17" (1/1) ... [2023-11-21 21:29:17,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355d155c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:17, skipping insertion in model container [2023-11-21 21:29:17,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:29:17" (1/1) ... [2023-11-21 21:29:17,834 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:29:18,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:29:18,396 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:29:18,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:29:18,578 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:29:18,578 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:29:18,584 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:29:18,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18 WrapperNode [2023-11-21 21:29:18,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:29:18,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:29:18,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:29:18,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:29:18,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,744 INFO L138 Inliner]: procedures = 490, calls = 133, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 3341 [2023-11-21 21:29:18,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:29:18,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:29:18,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:29:18,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:29:18,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:29:18,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:29:18,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:29:18,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:29:18,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (1/1) ... [2023-11-21 21:29:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:29:18,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:18,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:29:19,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:29:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-11-21 21:29:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-11-21 21:29:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:29:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:29:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:29:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:29:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 21:29:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:29:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:29:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:29:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:29:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:29:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:29:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 21:29:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:29:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:29:19,040 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:29:19,360 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:29:19,361 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:29:21,860 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:29:22,942 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:29:22,943 INFO L308 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-21 21:29:22,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:29:22 BoogieIcfgContainer [2023-11-21 21:29:22,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:29:22,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:29:22,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:29:22,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:29:22,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:29:17" (1/3) ... [2023-11-21 21:29:22,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76531a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:29:22, skipping insertion in model container [2023-11-21 21:29:22,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:18" (2/3) ... [2023-11-21 21:29:22,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76531a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:29:22, skipping insertion in model container [2023-11-21 21:29:22,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:29:22" (3/3) ... [2023-11-21 21:29:22,954 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-1.i [2023-11-21 21:29:22,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:29:22,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:29:22,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 256 error locations. [2023-11-21 21:29:22,969 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:29:23,165 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 21:29:23,228 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:23,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:29:23,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:23,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:29:23,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 21:29:23,258 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:29:23,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 21:29:23,271 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=PARTIAL_ORDER_FA, 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;@7260eb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:23,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2023-11-21 21:29:23,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:23,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1859969904, now seen corresponding path program 1 times [2023-11-21 21:29:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532310486] [2023-11-21 21:29:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:23,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532310486] [2023-11-21 21:29:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532310486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:24,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557100182] [2023-11-21 21:29:24,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:24,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:24,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-11-21 21:29:24,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:29:24,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:24,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 87273042, now seen corresponding path program 1 times [2023-11-21 21:29:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488122051] [2023-11-21 21:29:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488122051] [2023-11-21 21:29:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488122051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931460570] [2023-11-21 21:29:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:24,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:24,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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) [2023-11-21 21:29:24,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:29:24,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:24,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -682387679, now seen corresponding path program 1 times [2023-11-21 21:29:24,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:24,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108618240] [2023-11-21 21:29:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108618240] [2023-11-21 21:29:24,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108618240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:24,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:24,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069813102] [2023-11-21 21:29:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:24,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:24,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:24,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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) [2023-11-21 21:29:24,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:24,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:29:25,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:25,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1451165106, now seen corresponding path program 1 times [2023-11-21 21:29:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:25,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665951923] [2023-11-21 21:29:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665951923] [2023-11-21 21:29:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665951923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:25,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825684137] [2023-11-21 21:29:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:25,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:25,572 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:25,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 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) [2023-11-21 21:29:25,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:25,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:29:26,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:26,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -840868525, now seen corresponding path program 1 times [2023-11-21 21:29:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123292680] [2023-11-21 21:29:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123292680] [2023-11-21 21:29:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123292680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:29:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300331083] [2023-11-21 21:29:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:26,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:29:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:29:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:29:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:26,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:26,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2023-11-21 21:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:26,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:29:26,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:26,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1559517500, now seen corresponding path program 1 times [2023-11-21 21:29:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288794634] [2023-11-21 21:29:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:26,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288794634] [2023-11-21 21:29:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288794634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5887829] [2023-11-21 21:29:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:26,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:29:26,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:29:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:27,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:29:27,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:27,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5887829] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:27,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 21:29:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978252062] [2023-11-21 21:29:27,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:27,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:29:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:29:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:29:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:27,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:27,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 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) [2023-11-21 21:29:27,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:27,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:27,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:29:27,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-21 21:29:27,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:27,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 604371620, now seen corresponding path program 2 times [2023-11-21 21:29:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078032959] [2023-11-21 21:29:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078032959] [2023-11-21 21:29:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078032959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548641961] [2023-11-21 21:29:27,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:29:27,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:27,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:29:27,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 21:29:28,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:29:28,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:29:28,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:29:28,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:29,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:29:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548641961] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:29,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-21 21:29:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485681384] [2023-11-21 21:29:29,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:29:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:29:29,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:29:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:29,124 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:29,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 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) [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:29:29,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:29:29,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:29,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-21 21:29:29,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2093140589, now seen corresponding path program 3 times [2023-11-21 21:29:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162671455] [2023-11-21 21:29:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:29:29,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:29:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:29:29,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:29:29,614 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:29:29,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (234 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (233 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (232 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (231 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (230 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (229 of 235 remaining) [2023-11-21 21:29:29,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (228 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (227 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (226 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232ASSERT_VIOLATIONDATA_RACE (225 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 235 remaining) [2023-11-21 21:29:29,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 235 remaining) [2023-11-21 21:29:29,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 235 remaining) [2023-11-21 21:29:29,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233ASSERT_VIOLATIONDATA_RACE (219 of 235 remaining) [2023-11-21 21:29:29,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONDATA_RACE (218 of 235 remaining) [2023-11-21 21:29:29,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONDATA_RACE (217 of 235 remaining) [2023-11-21 21:29:29,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONDATA_RACE (216 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONDATA_RACE (215 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONDATA_RACE (214 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (213 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONDATA_RACE (212 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (211 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (210 of 235 remaining) [2023-11-21 21:29:29,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (209 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (208 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (207 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONDATA_RACE (206 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONDATA_RACE (205 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONDATA_RACE (203 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONDATA_RACE (202 of 235 remaining) [2023-11-21 21:29:29,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONDATA_RACE (201 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONDATA_RACE (200 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONDATA_RACE (199 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (198 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (197 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194ASSERT_VIOLATIONDATA_RACE (196 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (195 of 235 remaining) [2023-11-21 21:29:29,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (194 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195ASSERT_VIOLATIONDATA_RACE (193 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (192 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (191 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (190 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (189 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 235 remaining) [2023-11-21 21:29:29,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198ASSERT_VIOLATIONDATA_RACE (187 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199ASSERT_VIOLATIONDATA_RACE (186 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (185 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (184 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196ASSERT_VIOLATIONDATA_RACE (183 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (182 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197ASSERT_VIOLATIONDATA_RACE (181 of 235 remaining) [2023-11-21 21:29:29,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229ASSERT_VIOLATIONDATA_RACE (180 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200ASSERT_VIOLATIONDATA_RACE (179 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201ASSERT_VIOLATIONDATA_RACE (178 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203ASSERT_VIOLATIONDATA_RACE (177 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204ASSERT_VIOLATIONDATA_RACE (176 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202ASSERT_VIOLATIONDATA_RACE (175 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (174 of 235 remaining) [2023-11-21 21:29:29,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (173 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (172 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (171 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (170 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (169 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (168 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (167 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (166 of 235 remaining) [2023-11-21 21:29:29,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (165 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230ASSERT_VIOLATIONDATA_RACE (164 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205ASSERT_VIOLATIONDATA_RACE (163 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (162 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231ASSERT_VIOLATIONDATA_RACE (161 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (160 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (159 of 235 remaining) [2023-11-21 21:29:29,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206ASSERT_VIOLATIONDATA_RACE (158 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207ASSERT_VIOLATIONDATA_RACE (157 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (155 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (154 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (153 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (152 of 235 remaining) [2023-11-21 21:29:29,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (151 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (150 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (149 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208ASSERT_VIOLATIONDATA_RACE (148 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209ASSERT_VIOLATIONDATA_RACE (147 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211ASSERT_VIOLATIONDATA_RACE (146 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212ASSERT_VIOLATIONDATA_RACE (145 of 235 remaining) [2023-11-21 21:29:29,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210ASSERT_VIOLATIONDATA_RACE (144 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (143 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (142 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213ASSERT_VIOLATIONDATA_RACE (141 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (140 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (139 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (138 of 235 remaining) [2023-11-21 21:29:29,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (137 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214ASSERT_VIOLATIONDATA_RACE (136 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217ASSERT_VIOLATIONDATA_RACE (135 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218ASSERT_VIOLATIONDATA_RACE (134 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (133 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (132 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (131 of 235 remaining) [2023-11-21 21:29:29,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215ASSERT_VIOLATIONDATA_RACE (130 of 235 remaining) [2023-11-21 21:29:29,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (129 of 235 remaining) [2023-11-21 21:29:29,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (128 of 235 remaining) [2023-11-21 21:29:29,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (127 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (126 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (125 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (124 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (123 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216ASSERT_VIOLATIONDATA_RACE (122 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (121 of 235 remaining) [2023-11-21 21:29:29,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (120 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (119 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (118 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (117 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (116 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (115 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (114 of 235 remaining) [2023-11-21 21:29:29,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (113 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219ASSERT_VIOLATIONDATA_RACE (112 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220ASSERT_VIOLATIONDATA_RACE (111 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222ASSERT_VIOLATIONDATA_RACE (110 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223ASSERT_VIOLATIONDATA_RACE (109 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221ASSERT_VIOLATIONDATA_RACE (108 of 235 remaining) [2023-11-21 21:29:29,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (107 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (106 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224ASSERT_VIOLATIONDATA_RACE (105 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (104 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (103 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (102 of 235 remaining) [2023-11-21 21:29:29,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (101 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (100 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (99 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (98 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (97 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (96 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (95 of 235 remaining) [2023-11-21 21:29:29,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (94 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (93 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (92 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (91 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONDATA_RACE (90 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONDATA_RACE (89 of 235 remaining) [2023-11-21 21:29:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONDATA_RACE (88 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (87 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (86 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225ASSERT_VIOLATIONDATA_RACE (85 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226ASSERT_VIOLATIONDATA_RACE (84 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (83 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONDATA_RACE (82 of 235 remaining) [2023-11-21 21:29:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (81 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (80 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (79 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (78 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (77 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227ASSERT_VIOLATIONDATA_RACE (76 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228ASSERT_VIOLATIONDATA_RACE (75 of 235 remaining) [2023-11-21 21:29:29,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONDATA_RACE (74 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONDATA_RACE (73 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (72 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (71 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONDATA_RACE (70 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONDATA_RACE (69 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONDATA_RACE (68 of 235 remaining) [2023-11-21 21:29:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONDATA_RACE (67 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONDATA_RACE (66 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (65 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (64 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONDATA_RACE (63 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (62 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (61 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (60 of 235 remaining) [2023-11-21 21:29:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONDATA_RACE (59 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONDATA_RACE (58 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONDATA_RACE (57 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (56 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (55 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONDATA_RACE (54 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (53 of 235 remaining) [2023-11-21 21:29:29,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (52 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (51 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (50 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (49 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (48 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONDATA_RACE (47 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (46 of 235 remaining) [2023-11-21 21:29:29,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (45 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (44 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONDATA_RACE (43 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (42 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONDATA_RACE (41 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONDATA_RACE (40 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONDATA_RACE (39 of 235 remaining) [2023-11-21 21:29:29,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONDATA_RACE (38 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONDATA_RACE (37 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (36 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (35 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (34 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONDATA_RACE (33 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (32 of 235 remaining) [2023-11-21 21:29:29,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (31 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONDATA_RACE (30 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (29 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONDATA_RACE (28 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (27 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (26 of 235 remaining) [2023-11-21 21:29:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (25 of 235 remaining) [2023-11-21 21:29:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (24 of 235 remaining) [2023-11-21 21:29:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (23 of 235 remaining) [2023-11-21 21:29:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONDATA_RACE (22 of 235 remaining) [2023-11-21 21:29:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONDATA_RACE (21 of 235 remaining) [2023-11-21 21:29:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONDATA_RACE (20 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONDATA_RACE (19 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONDATA_RACE (18 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONDATA_RACE (17 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONDATA_RACE (16 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONDATA_RACE (15 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONDATA_RACE (14 of 235 remaining) [2023-11-21 21:29:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONDATA_RACE (13 of 235 remaining) [2023-11-21 21:29:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONDATA_RACE (12 of 235 remaining) [2023-11-21 21:29:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONDATA_RACE (11 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONDATA_RACE (10 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONDATA_RACE (9 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONDATA_RACE (8 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONDATA_RACE (7 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONDATA_RACE (6 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONDATA_RACE (5 of 235 remaining) [2023-11-21 21:29:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONDATA_RACE (4 of 235 remaining) [2023-11-21 21:29:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONDATA_RACE (3 of 235 remaining) [2023-11-21 21:29:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONDATA_RACE (2 of 235 remaining) [2023-11-21 21:29:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONDATA_RACE (1 of 235 remaining) [2023-11-21 21:29:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONDATA_RACE (0 of 235 remaining) [2023-11-21 21:29:29,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:29:29,669 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-21 21:29:29,670 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-11-21 21:29:29,671 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 21:29:29,671 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 21:29:29,811 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 21:29:29,827 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:29,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:29:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:29,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:29:29,844 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:29:29,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == StealerThread1of2ForFork0 ======== [2023-11-21 21:29:29,844 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=PARTIAL_ORDER_FA, 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;@7260eb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:29,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-21 21:29:29,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-21 21:29:34,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting StealerErr0ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:29:34,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 931878958, now seen corresponding path program 1 times [2023-11-21 21:29:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249810458] [2023-11-21 21:29:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249810458] [2023-11-21 21:29:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249810458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:34,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:29:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271896087] [2023-11-21 21:29:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:29:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:29:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:29:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:34,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:34,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) [2023-11-21 21:29:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:35,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:29:35,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting StealerErr5ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:29:35,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -321027789, now seen corresponding path program 1 times [2023-11-21 21:29:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983432206] [2023-11-21 21:29:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983432206] [2023-11-21 21:29:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983432206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527719675] [2023-11-21 21:29:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:35,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:29:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 21:29:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:35,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:29:35,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:35,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527719675] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:35,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 21:29:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531703291] [2023-11-21 21:29:35,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:29:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:29:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:29:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:35,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 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) [2023-11-21 21:29:35,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:35,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:36,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:29:36,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-21 21:29:36,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting StealerErr5ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:29:36,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash 942156243, now seen corresponding path program 2 times [2023-11-21 21:29:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818188698] [2023-11-21 21:29:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818188698] [2023-11-21 21:29:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818188698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846056100] [2023-11-21 21:29:36,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:29:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:36,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:29:36,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 21:29:37,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 21:29:37,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:29:37,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-21 21:29:37,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:37,173 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 [2023-11-21 21:29:37,185 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 [2023-11-21 21:29:37,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:29:37,279 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:29:37,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:29:37,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 21:29:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-21 21:29:37,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:29:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846056100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:37,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:29:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-21 21:29:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639964133] [2023-11-21 21:29:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:37,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:29:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:29:37,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:29:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:37,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:37,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 7 states have internal predecessors, (148), 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) [2023-11-21 21:29:37,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:37,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:37,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:29:57,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-21 21:29:58,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:58,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:29:58,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -158451563, now seen corresponding path program 1 times [2023-11-21 21:29:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111249248] [2023-11-21 21:29:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111249248] [2023-11-21 21:29:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111249248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677966218] [2023-11-21 21:29:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:58,388 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:29:58,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 21:29:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:58,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:29:58,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:58,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:29:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677966218] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:58,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-21 21:29:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385223423] [2023-11-21 21:29:58,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:58,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:29:58,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:29:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:29:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:58,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:58,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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) [2023-11-21 21:29:58,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:58,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:58,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:29:58,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:29:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:29:59,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 21:29:59,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-21 21:29:59,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:29:59,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1843059712, now seen corresponding path program 2 times [2023-11-21 21:29:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006063298] [2023-11-21 21:29:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:00,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006063298] [2023-11-21 21:30:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006063298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622659961] [2023-11-21 21:30:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:00,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:00,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.4) internal successors, (217), 6 states have internal predecessors, (217), 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) [2023-11-21 21:30:00,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:00,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:00,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:00,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:00,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:10,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:30:10,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:30:10,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -704215065, now seen corresponding path program 1 times [2023-11-21 21:30:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295311328] [2023-11-21 21:30:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295311328] [2023-11-21 21:30:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295311328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:11,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:11,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411889517] [2023-11-21 21:30:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:11,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:11,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.6) internal successors, (228), 6 states have internal predecessors, (228), 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) [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:11,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:30:21,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting StealerErr16ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:30:21,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2042863976, now seen corresponding path program 1 times [2023-11-21 21:30:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957582767] [2023-11-21 21:30:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957582767] [2023-11-21 21:30:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957582767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:22,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:22,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709190463] [2023-11-21 21:30:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:22,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:22,072 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:22,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 47.0) internal successors, (235), 6 states have internal predecessors, (235), 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) [2023-11-21 21:30:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:22,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:22,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:31,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:30:31,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting StealerErr19ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:30:31,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1991185324, now seen corresponding path program 1 times [2023-11-21 21:30:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404214035] [2023-11-21 21:30:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404214035] [2023-11-21 21:30:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404214035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234434944] [2023-11-21 21:30:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:32,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:32,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:32,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.6) internal successors, (253), 6 states have internal predecessors, (253), 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) [2023-11-21 21:30:32,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:32,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:32,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:30:42,061 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting StealerErr20ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:30:42,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1248694803, now seen corresponding path program 1 times [2023-11-21 21:30:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199974781] [2023-11-21 21:30:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199974781] [2023-11-21 21:30:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199974781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744880677] [2023-11-21 21:30:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:42,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:42,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 52.4) internal successors, (262), 6 states have internal predecessors, (262), 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) [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:42,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:52,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:30:52,438 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:30:52,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1909487336, now seen corresponding path program 1 times [2023-11-21 21:30:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487381] [2023-11-21 21:30:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-21 21:30:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487381] [2023-11-21 21:30:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237483672] [2023-11-21 21:30:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:53,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:53,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:53,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.0) internal successors, (270), 6 states have internal predecessors, (270), 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) [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:53,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:53,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:53,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:31:04,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-21 21:31:04,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:31:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 672298144, now seen corresponding path program 1 times [2023-11-21 21:31:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:31:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219073754] [2023-11-21 21:31:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:31:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:31:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:31:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-21 21:31:23,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:31:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219073754] [2023-11-21 21:31:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219073754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:31:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523495989] [2023-11-21 21:31:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:31:23,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:31:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:31:23,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:31:23,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 21:31:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:31:23,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-21 21:31:23,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:31:24,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:31:24,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 21:31:24,579 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 15 treesize of output 1 [2023-11-21 21:31:25,346 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 [2023-11-21 21:31:25,728 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 23 treesize of output 16 [2023-11-21 21:31:25,887 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 23 treesize of output 16 [2023-11-21 21:31:26,016 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 23 treesize of output 16 [2023-11-21 21:31:26,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:26,324 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 23 treesize of output 16 [2023-11-21 21:31:26,524 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 23 treesize of output 16 [2023-11-21 21:31:27,252 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 30 treesize of output 21 [2023-11-21 21:31:27,783 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 30 treesize of output 21 [2023-11-21 21:31:28,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:28,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:28,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:28,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 24 [2023-11-21 21:31:29,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:29,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:29,656 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 22 treesize of output 10 [2023-11-21 21:31:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-21 21:31:29,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:31:30,456 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-21 21:31:30,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 242 [2023-11-21 21:31:30,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 214 [2023-11-21 21:31:30,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:30,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 208 [2023-11-21 21:31:30,555 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-21 21:31:30,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 149 [2023-11-21 21:31:30,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:30,566 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 143 treesize of output 137 [2023-11-21 21:31:30,588 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 35 treesize of output 13 [2023-11-21 21:31:30,598 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 35 treesize of output 13 [2023-11-21 21:31:30,623 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse2 (+ 104 |c_~#q~0.offset|)) (.cse0 (= (select .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|)))) (and (or (not .cse0) (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse2))))) (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse2))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse0)))) is different from false [2023-11-21 21:31:30,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse1 (= (select .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|))) (.cse0 (+ 104 |c_~#q~0.offset|))) (and (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse0))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse1) (or (not .cse1) (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse0)))))))) is different from false [2023-11-21 21:31:31,014 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 5 treesize of output 3 [2023-11-21 21:32:06,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (< 0 (select .cse4 (+ 104 |c_~#q~0.offset|))) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (forall ((v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))) is different from false [2023-11-21 21:32:06,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse2 |c_~#q~0.base|))) (or (= (select .cse0 .cse1) 0) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))))))) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse1 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))) is different from false [2023-11-21 21:32:06,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= (select .cse1 .cse3) 0))))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (store (select .cse4 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))))) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|))))) is different from false [2023-11-21 21:32:06,864 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (= (select .cse7 .cse2) 0) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:07,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (not (= 0 (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse1 (+ 104 |c_~#q~0.offset|))))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse3 |c_~#q~0.base|))) (or (not (= 0 (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= 0 (select .cse4 .cse5)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= 0 (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:07,511 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse1 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse5) 0) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:07,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse1 |c_~#q~0.base|))) (or (< 0 (select .cse0 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse1 |c_~#q~0.base| (store .cse0 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse3 (select .cse5 |c_~#q~0.base|))) (or (= (select .cse3 .cse4) 0) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse3 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse4 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:08,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (= (select .cse4 .cse2) 0) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))))))))) is different from false [2023-11-21 21:32:08,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse1 |c_~#q~0.base|))) (or (< 0 (select .cse0 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse1 |c_~#q~0.base| (store .cse0 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse5) 0) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:09,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (< 0 (select .cse4 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:09,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse5 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:09,816 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse2 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse2 |c_~#q~0.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (store (select .cse5 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| .cse6) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse1 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))))))))) is different from false [2023-11-21 21:32:09,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (= (select .cse6 .cse2) 0) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse8 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse8 |c_~#q~0.base|))) (or (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse8 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:09,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse6 |c_~#q~0.base|))) (or (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse8 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse8 |c_~#q~0.base|))) (or (= (select .cse7 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse8 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:10,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:10,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse8 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:10,218 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base|) |c_ULTIMATE.start_writeV_#in~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:10,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36))) (let ((.cse4 (+ 32 |c_~#q~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#q~0.base| (store (select |c_#memory_int| |c_~#q~0.base|) .cse2 0)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222)) (.cse1 (store (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|) .cse4 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|)))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|))) (or (not (= (select (select (store (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base| (store .cse5 .cse4 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse5 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|)))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|))) (or (not (= (select (select (store (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-21 21:32:10,714 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2023-11-21 21:32:10,714 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 3 case distinctions, treesize of input 548 treesize of output 433 [2023-11-21 21:32:10,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:10,740 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 12132 treesize of output 11990 [2023-11-21 21:32:10,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:10,842 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 1616 treesize of output 1604 [2023-11-21 21:32:10,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:10,876 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 1802 treesize of output 1768 [2023-11-21 21:32:10,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:10,919 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 2197 treesize of output 2119 [2023-11-21 21:32:12,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-21 21:32:12,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:12,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 176 [2023-11-21 21:32:12,567 INFO L349 Elim1Store]: treesize reduction 89, result has 11.9 percent of original size [2023-11-21 21:32:12,568 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1048 treesize of output 780 [2023-11-21 21:32:12,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 636 treesize of output 602 [2023-11-21 21:32:12,609 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-21 21:32:12,609 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 1594 treesize of output 1542 [2023-11-21 21:32:12,665 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 615 treesize of output 611 [2023-11-21 21:32:12,678 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 852 treesize of output 836 [2023-11-21 21:32:12,690 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 836 treesize of output 828 [2023-11-21 21:32:12,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:12,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 548 treesize of output 421 [2023-11-21 21:32:12,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:12,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:12,885 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 336 treesize of output 320 [2023-11-21 21:32:12,894 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 286 treesize of output 282 [2023-11-21 21:32:12,903 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 282 treesize of output 274 [2023-11-21 21:32:12,912 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 274 treesize of output 272 [2023-11-21 21:32:13,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 21:32:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 88 not checked. [2023-11-21 21:32:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523495989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:32:14,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:32:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 49] total 142 [2023-11-21 21:32:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103142042] [2023-11-21 21:32:14,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:32:14,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-11-21 21:32:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:32:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-11-21 21:32:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=14188, Unknown=71, NotChecked=5180, Total=20022 [2023-11-21 21:32:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:32:14,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:32:14,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 5.612676056338028) internal successors, (797), 142 states have internal predecessors, (797), 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) [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:14,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15