./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.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-2.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 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 21:29:25,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:29:25,312 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:25,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:29:25,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:29:25,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:29:25,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:29:25,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:29:25,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:29:25,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:29:25,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:29:25,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:29:25,333 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:29:25,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:29:25,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:29:25,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:29:25,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:29:25,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:29:25,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:29:25,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:29:25,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:29:25,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:29:25,341 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 21:29:25,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:29:25,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:29:25,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:29:25,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:29:25,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:29:25,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:29:25,343 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 21:29:25,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:29:25,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:29:25,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:29:25,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:29:25,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:29:25,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:29:25,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:29:25,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:29:25,346 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 21:29:25,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 21:29:25,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:29:25,347 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 21:29:25,347 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 21:29:25,347 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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2023-11-21 21:29:25,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:29:25,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:29:25,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:29:25,579 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:29:25,582 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:29:25,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-21 21:29:26,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:29:26,909 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:29:26,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-21 21:29:26,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1316a1b2e/6a54d5eb3b4e4a18999af45d7335aed2/FLAG4b653b7fe [2023-11-21 21:29:26,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1316a1b2e/6a54d5eb3b4e4a18999af45d7335aed2 [2023-11-21 21:29:26,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:29:26,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:29:26,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:29:26,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:29:26,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:29:26,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:29:26" (1/1) ... [2023-11-21 21:29:26,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67189ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:26, skipping insertion in model container [2023-11-21 21:29:26,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:29:26" (1/1) ... [2023-11-21 21:29:27,010 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:29:27,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:29:27,447 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:29:27,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:29:27,602 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:29:27,603 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:29:27,609 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:29:27,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:27 WrapperNode [2023-11-21 21:29:27,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:29:27,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:29:27,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:29:27,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:29:27,616 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:27" (1/1) ... [2023-11-21 21:29:27,636 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:27" (1/1) ... [2023-11-21 21:29:27,796 INFO L138 Inliner]: procedures = 490, calls = 133, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 3341 [2023-11-21 21:29:27,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:29:27,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:29:27,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:29:27,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:29:27,804 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:27" (1/1) ... [2023-11-21 21:29:27,805 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:27" (1/1) ... [2023-11-21 21:29:27,840 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:27" (1/1) ... [2023-11-21 21:29:27,841 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:27" (1/1) ... [2023-11-21 21:29:27,929 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:27" (1/1) ... [2023-11-21 21:29:27,948 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:27" (1/1) ... [2023-11-21 21:29:27,964 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:27" (1/1) ... [2023-11-21 21:29:27,978 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:27" (1/1) ... [2023-11-21 21:29:28,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:29:28,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:29:28,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:29:28,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:29:28,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:27" (1/1) ... [2023-11-21 21:29:28,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:29:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:28,051 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:28,057 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:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-11-21 21:29:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-11-21 21:29:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:29:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:29:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:29:28,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:29:28,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:29:28,091 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 21:29:28,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:29:28,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:29:28,093 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:28,327 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:29:28,329 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:29:30,854 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:29:31,899 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:29:31,900 INFO L308 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-21 21:29:31,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:29:31 BoogieIcfgContainer [2023-11-21 21:29:31,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:29:31,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:29:31,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:29:31,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:29:31,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:29:26" (1/3) ... [2023-11-21 21:29:31,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347dc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:29:31, skipping insertion in model container [2023-11-21 21:29:31,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:29:27" (2/3) ... [2023-11-21 21:29:31,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347dc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:29:31, skipping insertion in model container [2023-11-21 21:29:31,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:29:31" (3/3) ... [2023-11-21 21:29:31,908 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-11-21 21:29:31,914 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:29:31,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:29:31,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 256 error locations. [2023-11-21 21:29:31,921 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:29:32,104 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 21:29:32,151 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:29:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:32,164 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:32,195 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:32,236 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:29:32,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 21:29:32,248 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;@34bc1b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:32,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2023-11-21 21:29:32,276 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:32,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -175989322, now seen corresponding path program 1 times [2023-11-21 21:29:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:32,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758377913] [2023-11-21 21:29:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:33,007 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:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758377913] [2023-11-21 21:29:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758377913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:33,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504837387] [2023-11-21 21:29:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:33,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:33,037 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:33,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:29:33,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:33,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash 550251739, now seen corresponding path program 1 times [2023-11-21 21:29:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:33,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21630375] [2023-11-21 21:29:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:33,402 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:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21630375] [2023-11-21 21:29:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21630375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876187176] [2023-11-21 21:29:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:33,407 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:33,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:29:33,520 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:33,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2052957850, now seen corresponding path program 1 times [2023-11-21 21:29:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218378933] [2023-11-21 21:29:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:33,839 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:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218378933] [2023-11-21 21:29:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218378933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:33,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:33,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641524090] [2023-11-21 21:29:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:33,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:33,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:33,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:33,843 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:33,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:33,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:29:33,959 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:33,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -926548352, now seen corresponding path program 1 times [2023-11-21 21:29:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305964156] [2023-11-21 21:29:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:34,323 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,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305964156] [2023-11-21 21:29:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305964156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:29:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269132556] [2023-11-21 21:29:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:29:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:29:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:29:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:34,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:34,326 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:34,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:34,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:34,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:34,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:29:35,241 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:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash -531652095, now seen corresponding path program 1 times [2023-11-21 21:29:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112802013] [2023-11-21 21:29:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:35,342 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:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:35,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112802013] [2023-11-21 21:29:35,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112802013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:35,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:35,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:29:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087391740] [2023-11-21 21:29:35,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:35,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:29:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:29:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:29:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:35,349 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:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:35,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:29:35,412 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:35,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -686131786, now seen corresponding path program 1 times [2023-11-21 21:29:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968777780] [2023-11-21 21:29:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:35,557 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:35,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:35,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968777780] [2023-11-21 21:29:35,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968777780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:35,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812739943] [2023-11-21 21:29:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:35,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:35,636 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:35,668 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:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:35,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:29:35,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:35,867 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:35,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:35,904 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:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812739943] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:35,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 21:29:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681115383] [2023-11-21 21:29:35,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:35,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:29:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:35,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:29:35,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:29:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:35,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:35,911 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:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:36,039 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:36,224 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:36,225 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:36,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1739229462, now seen corresponding path program 2 times [2023-11-21 21:29:36,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107690099] [2023-11-21 21:29:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:36,602 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:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107690099] [2023-11-21 21:29:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107690099] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849562530] [2023-11-21 21:29:36,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:29:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:36,604 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:36,619 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:37,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:29:37,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:29:37,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:29:37,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:37,909 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:37,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:37,997 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:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849562530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:37,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-21 21:29:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493316593] [2023-11-21 21:29:37,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:37,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:29:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:29:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:29:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:38,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:38,002 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:38,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:38,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:38,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:29:38,130 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:38,330 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:38,331 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:38,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1912732481, now seen corresponding path program 3 times [2023-11-21 21:29:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821631770] [2023-11-21 21:29:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:29:38,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:29:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:29:38,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:29:38,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:29:38,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (234 of 235 remaining) [2023-11-21 21:29:38,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (233 of 235 remaining) [2023-11-21 21:29:38,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (232 of 235 remaining) [2023-11-21 21:29:38,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (231 of 235 remaining) [2023-11-21 21:29:38,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (230 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (229 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (228 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (227 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (226 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232ASSERT_VIOLATIONDATA_RACE (225 of 235 remaining) [2023-11-21 21:29:38,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233ASSERT_VIOLATIONDATA_RACE (219 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONDATA_RACE (218 of 235 remaining) [2023-11-21 21:29:38,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONDATA_RACE (217 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONDATA_RACE (216 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONDATA_RACE (215 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONDATA_RACE (214 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (213 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONDATA_RACE (212 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (211 of 235 remaining) [2023-11-21 21:29:38,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (210 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (209 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (208 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (207 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONDATA_RACE (206 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONDATA_RACE (205 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 235 remaining) [2023-11-21 21:29:38,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONDATA_RACE (203 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONDATA_RACE (202 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONDATA_RACE (201 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONDATA_RACE (200 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONDATA_RACE (199 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (198 of 235 remaining) [2023-11-21 21:29:38,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (197 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194ASSERT_VIOLATIONDATA_RACE (196 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (195 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (194 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195ASSERT_VIOLATIONDATA_RACE (193 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (192 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (191 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (190 of 235 remaining) [2023-11-21 21:29:38,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (189 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198ASSERT_VIOLATIONDATA_RACE (187 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199ASSERT_VIOLATIONDATA_RACE (186 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (185 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (184 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196ASSERT_VIOLATIONDATA_RACE (183 of 235 remaining) [2023-11-21 21:29:38,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (182 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197ASSERT_VIOLATIONDATA_RACE (181 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229ASSERT_VIOLATIONDATA_RACE (180 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200ASSERT_VIOLATIONDATA_RACE (179 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201ASSERT_VIOLATIONDATA_RACE (178 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203ASSERT_VIOLATIONDATA_RACE (177 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204ASSERT_VIOLATIONDATA_RACE (176 of 235 remaining) [2023-11-21 21:29:38,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202ASSERT_VIOLATIONDATA_RACE (175 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (174 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (173 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (172 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (171 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (170 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (169 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (168 of 235 remaining) [2023-11-21 21:29:38,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (167 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (166 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (165 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230ASSERT_VIOLATIONDATA_RACE (164 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205ASSERT_VIOLATIONDATA_RACE (163 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (162 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231ASSERT_VIOLATIONDATA_RACE (161 of 235 remaining) [2023-11-21 21:29:38,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (160 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (159 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206ASSERT_VIOLATIONDATA_RACE (158 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207ASSERT_VIOLATIONDATA_RACE (157 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (155 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (154 of 235 remaining) [2023-11-21 21:29:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (153 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (152 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (151 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (150 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (149 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208ASSERT_VIOLATIONDATA_RACE (148 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209ASSERT_VIOLATIONDATA_RACE (147 of 235 remaining) [2023-11-21 21:29:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211ASSERT_VIOLATIONDATA_RACE (146 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212ASSERT_VIOLATIONDATA_RACE (145 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210ASSERT_VIOLATIONDATA_RACE (144 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (143 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (142 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213ASSERT_VIOLATIONDATA_RACE (141 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (140 of 235 remaining) [2023-11-21 21:29:38,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (139 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (138 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (137 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214ASSERT_VIOLATIONDATA_RACE (136 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217ASSERT_VIOLATIONDATA_RACE (135 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218ASSERT_VIOLATIONDATA_RACE (134 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (133 of 235 remaining) [2023-11-21 21:29:38,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (132 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (131 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215ASSERT_VIOLATIONDATA_RACE (130 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (129 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (128 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (127 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (126 of 235 remaining) [2023-11-21 21:29:38,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (125 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (124 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (123 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216ASSERT_VIOLATIONDATA_RACE (122 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (121 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (120 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (119 of 235 remaining) [2023-11-21 21:29:38,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (118 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (117 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (116 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (115 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (114 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (113 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219ASSERT_VIOLATIONDATA_RACE (112 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220ASSERT_VIOLATIONDATA_RACE (111 of 235 remaining) [2023-11-21 21:29:38,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222ASSERT_VIOLATIONDATA_RACE (110 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223ASSERT_VIOLATIONDATA_RACE (109 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221ASSERT_VIOLATIONDATA_RACE (108 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (107 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (106 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224ASSERT_VIOLATIONDATA_RACE (105 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (104 of 235 remaining) [2023-11-21 21:29:38,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (103 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (102 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (101 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (100 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (99 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (98 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (97 of 235 remaining) [2023-11-21 21:29:38,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (96 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (95 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (94 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (93 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (92 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (91 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONDATA_RACE (90 of 235 remaining) [2023-11-21 21:29:38,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONDATA_RACE (89 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONDATA_RACE (88 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (87 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (86 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225ASSERT_VIOLATIONDATA_RACE (85 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226ASSERT_VIOLATIONDATA_RACE (84 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (83 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONDATA_RACE (82 of 235 remaining) [2023-11-21 21:29:38,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (81 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (80 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (79 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (78 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (77 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227ASSERT_VIOLATIONDATA_RACE (76 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228ASSERT_VIOLATIONDATA_RACE (75 of 235 remaining) [2023-11-21 21:29:38,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONDATA_RACE (74 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONDATA_RACE (73 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (72 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (71 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONDATA_RACE (70 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONDATA_RACE (69 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONDATA_RACE (68 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONDATA_RACE (67 of 235 remaining) [2023-11-21 21:29:38,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONDATA_RACE (66 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (65 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (64 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONDATA_RACE (63 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (62 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (61 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (60 of 235 remaining) [2023-11-21 21:29:38,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONDATA_RACE (59 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONDATA_RACE (58 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONDATA_RACE (57 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (56 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (55 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONDATA_RACE (54 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (53 of 235 remaining) [2023-11-21 21:29:38,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (52 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (51 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (50 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (49 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (48 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONDATA_RACE (47 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (46 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (45 of 235 remaining) [2023-11-21 21:29:38,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (44 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONDATA_RACE (43 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (42 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONDATA_RACE (41 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONDATA_RACE (40 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONDATA_RACE (39 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONDATA_RACE (38 of 235 remaining) [2023-11-21 21:29:38,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONDATA_RACE (37 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (36 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (35 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (34 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONDATA_RACE (33 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (32 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (31 of 235 remaining) [2023-11-21 21:29:38,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONDATA_RACE (30 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (29 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONDATA_RACE (28 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (27 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (26 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (25 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (24 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (23 of 235 remaining) [2023-11-21 21:29:38,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONDATA_RACE (22 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONDATA_RACE (21 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONDATA_RACE (20 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONDATA_RACE (19 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONDATA_RACE (18 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONDATA_RACE (17 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONDATA_RACE (16 of 235 remaining) [2023-11-21 21:29:38,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONDATA_RACE (15 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONDATA_RACE (14 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONDATA_RACE (13 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONDATA_RACE (12 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONDATA_RACE (11 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONDATA_RACE (10 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONDATA_RACE (9 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONDATA_RACE (8 of 235 remaining) [2023-11-21 21:29:38,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONDATA_RACE (7 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONDATA_RACE (6 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONDATA_RACE (5 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONDATA_RACE (4 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONDATA_RACE (3 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONDATA_RACE (2 of 235 remaining) [2023-11-21 21:29:38,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONDATA_RACE (1 of 235 remaining) [2023-11-21 21:29:38,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONDATA_RACE (0 of 235 remaining) [2023-11-21 21:29:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:29:38,485 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-21 21:29:38,486 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:38,487 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 21:29:38,487 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 21:29:38,627 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 21:29:38,642 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:38,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:29:38,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:38,643 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:38,672 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:38,675 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:29:38,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == StealerThread1of2ForFork0 ======== [2023-11-21 21:29:38,676 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;@34bc1b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:29:38,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-21 21:29:43,031 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:43,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 836256512, now seen corresponding path program 1 times [2023-11-21 21:29:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579661796] [2023-11-21 21:29:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:43,112 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:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579661796] [2023-11-21 21:29:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579661796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:29:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:29:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049512012] [2023-11-21 21:29:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:43,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:29:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:29:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:29:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:43,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:43,116 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:43,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:43,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:29:43,470 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:43,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash -70047139, now seen corresponding path program 1 times [2023-11-21 21:29:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272578001] [2023-11-21 21:29:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:43,719 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:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272578001] [2023-11-21 21:29:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272578001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091785090] [2023-11-21 21:29:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:43,760 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:43,763 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:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:44,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:29:44,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:44,042 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:44,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:29:44,075 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:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091785090] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:29:44,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:29:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 21:29:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99775021] [2023-11-21 21:29:44,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:29:44,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:29:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:29:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:29:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:44,080 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:44,080 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:44,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:44,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:44,351 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:44,548 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:44,548 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:44,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:29:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2137809789, now seen corresponding path program 2 times [2023-11-21 21:29:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:29:44,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310661208] [2023-11-21 21:29:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:29:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:29:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:29:44,794 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:44,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:29:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310661208] [2023-11-21 21:29:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310661208] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:29:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433100068] [2023-11-21 21:29:44,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:29:44,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:29:44,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:29:44,796 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:44,827 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:45,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 21:29:45,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:29:45,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-21 21:29:45,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:29:45,134 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:45,147 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:45,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:29:45,168 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:45,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:29:45,190 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:45,209 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:45,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:29:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433100068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:29:45,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:29:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-21 21:29:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003445897] [2023-11-21 21:29:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:29:45,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:29:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:29:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:29:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:29:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:29:45,213 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:29:45,213 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:45,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:29:45,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:29:45,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:05,693 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:30:05,881 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:30:05,881 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:30:05,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1951254827, now seen corresponding path program 1 times [2023-11-21 21:30:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568241132] [2023-11-21 21:30:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:06,303 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:30:06,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568241132] [2023-11-21 21:30:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568241132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:30:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90328138] [2023-11-21 21:30:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:06,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:30:06,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:30:06,305 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:30:06,306 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:30:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:06,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:30:06,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:30:06,736 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:30:06,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:30:06,814 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:30:06,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90328138] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:30:06,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:30:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-21 21:30:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72948498] [2023-11-21 21:30:06,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:30:06,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:30:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:30:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:30:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:06,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:06,819 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:30:06,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:06,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:06,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:06,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:07,473 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:30:07,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:30:07,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:30:07,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1579756590, now seen corresponding path program 2 times [2023-11-21 21:30:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783071743] [2023-11-21 21:30:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:08,529 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:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783071743] [2023-11-21 21:30:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783071743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:08,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875157604] [2023-11-21 21:30:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:08,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:08,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:08,534 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:08,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:08,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:18,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:30:18,169 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:18,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1653352235, now seen corresponding path program 1 times [2023-11-21 21:30:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414031397] [2023-11-21 21:30:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:18,821 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:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414031397] [2023-11-21 21:30:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414031397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045647970] [2023-11-21 21:30:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:18,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:18,827 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:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:18,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:28,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:30:28,553 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:28,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -343095830, now seen corresponding path program 1 times [2023-11-21 21:30:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67942104] [2023-11-21 21:30:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:28,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:29,227 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:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67942104] [2023-11-21 21:30:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67942104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914452288] [2023-11-21 21:30:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:29,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:29,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:29,233 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:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:29,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:39,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:30:39,237 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:39,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1780020610, now seen corresponding path program 1 times [2023-11-21 21:30:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127434308] [2023-11-21 21:30:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:40,121 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:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127434308] [2023-11-21 21:30:40,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127434308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:40,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:40,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808594657] [2023-11-21 21:30:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:40,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:40,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:40,129 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:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:40,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:40,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:40,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:49,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:30:49,920 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:49,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1342777217, now seen corresponding path program 1 times [2023-11-21 21:30:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:49,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498419999] [2023-11-21 21:30:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:30:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:30:50,518 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:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:30:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498419999] [2023-11-21 21:30:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498419999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:30:50,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:30:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:30:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466918031] [2023-11-21 21:30:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:30:50,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:30:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:30:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:30:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:30:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:50,523 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:30:50,523 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:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:50,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:30:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:30:59,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:30:59,953 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:59,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:30:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1389219974, now seen corresponding path program 1 times [2023-11-21 21:30:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:30:59,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944738420] [2023-11-21 21:30:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:30:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:31:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:31:00,593 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:31:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:31:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944738420] [2023-11-21 21:31:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944738420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:31:00,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:31:00,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:31:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989176171] [2023-11-21 21:31:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:31:00,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:31:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:31:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:31:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:31:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:31:00,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:31:00,597 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:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:00,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:31:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:31:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:31:10,886 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:10,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:31:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -247865934, now seen corresponding path program 1 times [2023-11-21 21:31:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:31:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930757423] [2023-11-21 21:31:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:31:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:31:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:31:31,014 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:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:31:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930757423] [2023-11-21 21:31:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930757423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:31:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075230624] [2023-11-21 21:31:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:31:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:31:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:31:31,022 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:31,024 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:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:31:31,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-21 21:31:31,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:31:31,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:31:31,722 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:32,232 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:33,092 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:33,635 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:33,773 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:34,095 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:34,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:34,371 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:34,548 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:35,082 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:35,543 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:36,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:36,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:36,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:36,456 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:37,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:31:37,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:37,445 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:37,538 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:37,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:31:38,257 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-21 21:31:38,257 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:38,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:38,273 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:38,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:38,302 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:38,363 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-21 21:31:38,364 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:38,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:31:38,374 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:38,394 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:38,401 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:39,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|))) (let ((.cse0 (+ 104 |c_~#q~0.offset|)) (.cse1 (= (select .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~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|)))) (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 (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~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_#in~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse0)))) (not .cse1))))) is different from false [2023-11-21 21:31:39,184 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:13,339 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:13,420 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:13,553 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:14,171 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:14,226 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:14,326 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:15,105 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:15,158 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:15,926 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:15,987 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:16,753 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:16,810 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:16,919 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:17,100 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:17,164 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:17,216 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:17,310 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:17,659 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2023-11-21 21:32:17,659 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:17,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:17,707 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:17,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:17,811 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:17,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:17,843 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:17,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:17,879 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:19,265 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:19,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:19,429 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:19,556 INFO L349 Elim1Store]: treesize reduction 89, result has 11.9 percent of original size [2023-11-21 21:32:19,556 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:19,572 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,576 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:19,591 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-21 21:32:19,591 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:19,632 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:19,644 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:19,660 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:19,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:19,829 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:19,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:32:19,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:32:19,847 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:19,855 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:19,884 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:19,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 274 treesize of output 272 [2023-11-21 21:32:19,984 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:21,163 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:21,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075230624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:32:21,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:32:21,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 49] total 142 [2023-11-21 21:32:21,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774776443] [2023-11-21 21:32:21,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:32:21,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-11-21 21:32:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:32:21,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-11-21 21:32:21,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=14554, Unknown=181, NotChecked=4698, Total=20022 [2023-11-21 21:32:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:32:21,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:32:21,175 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:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:32:21,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15