./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6568ba33 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a1634bb3c8fd20e3116589f39b7439eb06d3d5864b5afee415eff1cf39cd7c4 --- Real Ultimate output --- This is Ultimate 0.2.3-?-6568ba3-m [2023-11-24 01:14:02,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 01:14:02,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 01:14:02,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 01:14:02,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 01:14:02,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 01:14:02,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 01:14:02,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 01:14:02,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 01:14:02,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 01:14:02,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 01:14:02,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 01:14:02,126 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 01:14:02,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 01:14:02,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 01:14:02,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 01:14:02,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 01:14:02,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 01:14:02,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 01:14:02,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 01:14:02,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 01:14:02,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 01:14:02,129 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 01:14:02,129 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 01:14:02,130 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 01:14:02,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 01:14:02,130 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 01:14:02,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 01:14:02,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 01:14:02,131 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 01:14:02,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 01:14:02,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 01:14:02,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 01:14:02,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 01:14:02,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 01:14:02,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 01:14:02,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 01:14:02,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 01:14:02,133 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 01:14:02,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 01:14:02,133 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 01:14:02,134 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 01:14:02,134 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 01:14:02,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a1634bb3c8fd20e3116589f39b7439eb06d3d5864b5afee415eff1cf39cd7c4 [2023-11-24 01:14:02,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 01:14:02,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 01:14:02,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 01:14:02,357 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 01:14:02,357 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 01:14:02,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i [2023-11-24 01:14:03,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 01:14:03,748 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 01:14:03,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-1.i [2023-11-24 01:14:03,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdab800c0/cd8d519fa34b4ddaa202d0909d24a3d8/FLAGd62fd4954 [2023-11-24 01:14:03,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdab800c0/cd8d519fa34b4ddaa202d0909d24a3d8 [2023-11-24 01:14:03,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 01:14:03,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 01:14:03,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 01:14:03,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 01:14:03,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 01:14:03,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:03" (1/1) ... [2023-11-24 01:14:03,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72128790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:03, skipping insertion in model container [2023-11-24 01:14:03,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:03" (1/1) ... [2023-11-24 01:14:03,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 01:14:04,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 01:14:04,450 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 01:14:04,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 01:14:04,726 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 01:14:04,726 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 01:14:04,732 INFO L206 MainTranslator]: Completed translation [2023-11-24 01:14:04,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04 WrapperNode [2023-11-24 01:14:04,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 01:14:04,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 01:14:04,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 01:14:04,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 01:14:04,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:04,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:04,943 INFO L138 Inliner]: procedures = 490, calls = 133, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 3341 [2023-11-24 01:14:04,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 01:14:04,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 01:14:04,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 01:14:04,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 01:14:04,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:04,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:04,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:04,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 01:14:05,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 01:14:05,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 01:14:05,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 01:14:05,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (1/1) ... [2023-11-24 01:14:05,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 01:14:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:05,170 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-24 01:14:05,206 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-24 01:14:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-11-24 01:14:05,235 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 01:14:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 01:14:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 01:14:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 01:14:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 01:14:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 01:14:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 01:14:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 01:14:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 01:14:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 01:14:05,240 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 01:14:05,531 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 01:14:05,533 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 01:14:08,144 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 01:14:09,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 01:14:09,228 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-24 01:14:09,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:09 BoogieIcfgContainer [2023-11-24 01:14:09,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 01:14:09,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 01:14:09,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 01:14:09,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 01:14:09,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:14:03" (1/3) ... [2023-11-24 01:14:09,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c22aaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:09, skipping insertion in model container [2023-11-24 01:14:09,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:04" (2/3) ... [2023-11-24 01:14:09,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c22aaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:09, skipping insertion in model container [2023-11-24 01:14:09,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:09" (3/3) ... [2023-11-24 01:14:09,239 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-1.i [2023-11-24 01:14:09,259 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 01:14:09,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 01:14:09,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 256 error locations. [2023-11-24 01:14:09,266 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 01:14:09,427 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 01:14:09,473 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 01:14:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:09,489 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-24 01:14:09,499 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-24 01:14:09,525 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 01:14:09,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 01:14:09,538 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;@1bf28a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:09,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2023-11-24 01:14:09,566 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-24 01:14:09,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1859969904, now seen corresponding path program 1 times [2023-11-24 01:14:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061173839] [2023-11-24 01:14:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:10,192 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-24 01:14:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061173839] [2023-11-24 01:14:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061173839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037279224] [2023-11-24 01:14:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:10,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:10,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:10,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:10,220 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-24 01:14:10,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 01:14:10,262 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-24 01:14:10,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 87273042, now seen corresponding path program 1 times [2023-11-24 01:14:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767535593] [2023-11-24 01:14:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:10,720 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-24 01:14:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767535593] [2023-11-24 01:14:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767535593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:10,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364024350] [2023-11-24 01:14:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:10,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:10,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:10,727 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-24 01:14:10,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:10,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:10,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 01:14:10,870 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-24 01:14:10,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -682387679, now seen corresponding path program 1 times [2023-11-24 01:14:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553170083] [2023-11-24 01:14:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:11,300 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-24 01:14:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553170083] [2023-11-24 01:14:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553170083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690976094] [2023-11-24 01:14:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:11,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:11,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:11,304 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-24 01:14:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 01:14:11,477 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-24 01:14:11,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1451165106, now seen corresponding path program 1 times [2023-11-24 01:14:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981201426] [2023-11-24 01:14:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:11,900 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-24 01:14:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981201426] [2023-11-24 01:14:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981201426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520887477] [2023-11-24 01:14:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:11,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:11,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:11,904 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-24 01:14:11,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:11,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 01:14:12,798 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-24 01:14:12,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash -840868525, now seen corresponding path program 1 times [2023-11-24 01:14:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473769133] [2023-11-24 01:14:12,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:12,886 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-24 01:14:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:12,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473769133] [2023-11-24 01:14:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473769133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:12,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:12,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 01:14:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724220913] [2023-11-24 01:14:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:12,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:14:12,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:14:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 01:14:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:12,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:12,893 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-24 01:14:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:12,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 01:14:12,967 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-24 01:14:12,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1559517500, now seen corresponding path program 1 times [2023-11-24 01:14:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556322750] [2023-11-24 01:14:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:13,103 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-24 01:14:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556322750] [2023-11-24 01:14:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556322750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626571646] [2023-11-24 01:14:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:13,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:13,157 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-24 01:14:13,185 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-24 01:14:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:13,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:14:13,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:13,398 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-24 01:14:13,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:13,435 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-24 01:14:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626571646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:13,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 01:14:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609428473] [2023-11-24 01:14:13,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:14:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:14:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:14:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:13,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:13,441 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-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:13,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:13,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 01:14:13,749 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-24 01:14:13,750 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-24 01:14:13,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 604371620, now seen corresponding path program 2 times [2023-11-24 01:14:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518300572] [2023-11-24 01:14:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:14,089 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-24 01:14:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518300572] [2023-11-24 01:14:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518300572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194544727] [2023-11-24 01:14:14,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 01:14:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:14,105 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-24 01:14:14,107 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-24 01:14:15,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 01:14:15,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 01:14:15,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 01:14:15,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:15,290 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-24 01:14:15,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:15,375 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-24 01:14:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194544727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:15,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 01:14:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211336304] [2023-11-24 01:14:15,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 01:14:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:15,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 01:14:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 01:14:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:15,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:15,386 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-24 01:14:15,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:15,523 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-24 01:14:15,720 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-24 01:14:15,720 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-24 01:14:15,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2093140589, now seen corresponding path program 3 times [2023-11-24 01:14:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402612632] [2023-11-24 01:14:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 01:14:15,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 01:14:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 01:14:15,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 01:14:15,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 01:14:15,914 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (234 of 235 remaining) [2023-11-24 01:14:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (233 of 235 remaining) [2023-11-24 01:14:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (232 of 235 remaining) [2023-11-24 01:14:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (231 of 235 remaining) [2023-11-24 01:14:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (230 of 235 remaining) [2023-11-24 01:14:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (229 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (228 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (227 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (226 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232ASSERT_VIOLATIONDATA_RACE (225 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 235 remaining) [2023-11-24 01:14:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 235 remaining) [2023-11-24 01:14:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 235 remaining) [2023-11-24 01:14:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 235 remaining) [2023-11-24 01:14:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233ASSERT_VIOLATIONDATA_RACE (219 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONDATA_RACE (218 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONDATA_RACE (217 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONDATA_RACE (216 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONDATA_RACE (215 of 235 remaining) [2023-11-24 01:14:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONDATA_RACE (214 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (213 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONDATA_RACE (212 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (211 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (210 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (209 of 235 remaining) [2023-11-24 01:14:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (208 of 235 remaining) [2023-11-24 01:14:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (207 of 235 remaining) [2023-11-24 01:14:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONDATA_RACE (206 of 235 remaining) [2023-11-24 01:14:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONDATA_RACE (205 of 235 remaining) [2023-11-24 01:14:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 235 remaining) [2023-11-24 01:14:15,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONDATA_RACE (203 of 235 remaining) [2023-11-24 01:14:15,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONDATA_RACE (202 of 235 remaining) [2023-11-24 01:14:15,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONDATA_RACE (201 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONDATA_RACE (200 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONDATA_RACE (199 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (198 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (197 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194ASSERT_VIOLATIONDATA_RACE (196 of 235 remaining) [2023-11-24 01:14:15,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (195 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (194 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195ASSERT_VIOLATIONDATA_RACE (193 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (192 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (191 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (190 of 235 remaining) [2023-11-24 01:14:15,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (189 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198ASSERT_VIOLATIONDATA_RACE (187 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199ASSERT_VIOLATIONDATA_RACE (186 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (185 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (184 of 235 remaining) [2023-11-24 01:14:15,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196ASSERT_VIOLATIONDATA_RACE (183 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (182 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197ASSERT_VIOLATIONDATA_RACE (181 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229ASSERT_VIOLATIONDATA_RACE (180 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200ASSERT_VIOLATIONDATA_RACE (179 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201ASSERT_VIOLATIONDATA_RACE (178 of 235 remaining) [2023-11-24 01:14:15,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203ASSERT_VIOLATIONDATA_RACE (177 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204ASSERT_VIOLATIONDATA_RACE (176 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202ASSERT_VIOLATIONDATA_RACE (175 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (174 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (173 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (172 of 235 remaining) [2023-11-24 01:14:15,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (171 of 235 remaining) [2023-11-24 01:14:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (170 of 235 remaining) [2023-11-24 01:14:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (169 of 235 remaining) [2023-11-24 01:14:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (168 of 235 remaining) [2023-11-24 01:14:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (167 of 235 remaining) [2023-11-24 01:14:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (166 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (165 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230ASSERT_VIOLATIONDATA_RACE (164 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205ASSERT_VIOLATIONDATA_RACE (163 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (162 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231ASSERT_VIOLATIONDATA_RACE (161 of 235 remaining) [2023-11-24 01:14:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (160 of 235 remaining) [2023-11-24 01:14:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (159 of 235 remaining) [2023-11-24 01:14:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206ASSERT_VIOLATIONDATA_RACE (158 of 235 remaining) [2023-11-24 01:14:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207ASSERT_VIOLATIONDATA_RACE (157 of 235 remaining) [2023-11-24 01:14:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 235 remaining) [2023-11-24 01:14:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (155 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (154 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (153 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (152 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (151 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (150 of 235 remaining) [2023-11-24 01:14:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (149 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208ASSERT_VIOLATIONDATA_RACE (148 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209ASSERT_VIOLATIONDATA_RACE (147 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211ASSERT_VIOLATIONDATA_RACE (146 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212ASSERT_VIOLATIONDATA_RACE (145 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210ASSERT_VIOLATIONDATA_RACE (144 of 235 remaining) [2023-11-24 01:14:15,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (143 of 235 remaining) [2023-11-24 01:14:15,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (142 of 235 remaining) [2023-11-24 01:14:15,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213ASSERT_VIOLATIONDATA_RACE (141 of 235 remaining) [2023-11-24 01:14:15,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (140 of 235 remaining) [2023-11-24 01:14:15,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (139 of 235 remaining) [2023-11-24 01:14:15,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (138 of 235 remaining) [2023-11-24 01:14:15,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (137 of 235 remaining) [2023-11-24 01:14:15,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214ASSERT_VIOLATIONDATA_RACE (136 of 235 remaining) [2023-11-24 01:14:15,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217ASSERT_VIOLATIONDATA_RACE (135 of 235 remaining) [2023-11-24 01:14:15,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218ASSERT_VIOLATIONDATA_RACE (134 of 235 remaining) [2023-11-24 01:14:15,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (133 of 235 remaining) [2023-11-24 01:14:15,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (132 of 235 remaining) [2023-11-24 01:14:15,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (131 of 235 remaining) [2023-11-24 01:14:15,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215ASSERT_VIOLATIONDATA_RACE (130 of 235 remaining) [2023-11-24 01:14:15,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (129 of 235 remaining) [2023-11-24 01:14:15,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (128 of 235 remaining) [2023-11-24 01:14:15,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (127 of 235 remaining) [2023-11-24 01:14:15,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (126 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (125 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (124 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (123 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216ASSERT_VIOLATIONDATA_RACE (122 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (121 of 235 remaining) [2023-11-24 01:14:15,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (120 of 235 remaining) [2023-11-24 01:14:15,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (119 of 235 remaining) [2023-11-24 01:14:15,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (118 of 235 remaining) [2023-11-24 01:14:15,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (117 of 235 remaining) [2023-11-24 01:14:15,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (116 of 235 remaining) [2023-11-24 01:14:15,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (115 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (114 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (113 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219ASSERT_VIOLATIONDATA_RACE (112 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220ASSERT_VIOLATIONDATA_RACE (111 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222ASSERT_VIOLATIONDATA_RACE (110 of 235 remaining) [2023-11-24 01:14:15,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223ASSERT_VIOLATIONDATA_RACE (109 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221ASSERT_VIOLATIONDATA_RACE (108 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (107 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (106 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224ASSERT_VIOLATIONDATA_RACE (105 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (104 of 235 remaining) [2023-11-24 01:14:15,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (103 of 235 remaining) [2023-11-24 01:14:15,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (102 of 235 remaining) [2023-11-24 01:14:15,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (101 of 235 remaining) [2023-11-24 01:14:15,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (100 of 235 remaining) [2023-11-24 01:14:15,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (99 of 235 remaining) [2023-11-24 01:14:15,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (98 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (97 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (96 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (95 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (94 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (93 of 235 remaining) [2023-11-24 01:14:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (92 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (91 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONDATA_RACE (90 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONDATA_RACE (89 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONDATA_RACE (88 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (87 of 235 remaining) [2023-11-24 01:14:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (86 of 235 remaining) [2023-11-24 01:14:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225ASSERT_VIOLATIONDATA_RACE (85 of 235 remaining) [2023-11-24 01:14:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226ASSERT_VIOLATIONDATA_RACE (84 of 235 remaining) [2023-11-24 01:14:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (83 of 235 remaining) [2023-11-24 01:14:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONDATA_RACE (82 of 235 remaining) [2023-11-24 01:14:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (81 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (80 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (79 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (78 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (77 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227ASSERT_VIOLATIONDATA_RACE (76 of 235 remaining) [2023-11-24 01:14:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228ASSERT_VIOLATIONDATA_RACE (75 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONDATA_RACE (74 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONDATA_RACE (73 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (72 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (71 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONDATA_RACE (70 of 235 remaining) [2023-11-24 01:14:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONDATA_RACE (69 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONDATA_RACE (68 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONDATA_RACE (67 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONDATA_RACE (66 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (65 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (64 of 235 remaining) [2023-11-24 01:14:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONDATA_RACE (63 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (62 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (61 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (60 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONDATA_RACE (59 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONDATA_RACE (58 of 235 remaining) [2023-11-24 01:14:15,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONDATA_RACE (57 of 235 remaining) [2023-11-24 01:14:15,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (56 of 235 remaining) [2023-11-24 01:14:15,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (55 of 235 remaining) [2023-11-24 01:14:15,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONDATA_RACE (54 of 235 remaining) [2023-11-24 01:14:15,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (53 of 235 remaining) [2023-11-24 01:14:15,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (52 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (51 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (50 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (49 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (48 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONDATA_RACE (47 of 235 remaining) [2023-11-24 01:14:15,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (46 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (45 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (44 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONDATA_RACE (43 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (42 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONDATA_RACE (41 of 235 remaining) [2023-11-24 01:14:15,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONDATA_RACE (40 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONDATA_RACE (39 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONDATA_RACE (38 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONDATA_RACE (37 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (36 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (35 of 235 remaining) [2023-11-24 01:14:15,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (34 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONDATA_RACE (33 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (32 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (31 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONDATA_RACE (30 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (29 of 235 remaining) [2023-11-24 01:14:15,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONDATA_RACE (28 of 235 remaining) [2023-11-24 01:14:15,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (27 of 235 remaining) [2023-11-24 01:14:15,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (26 of 235 remaining) [2023-11-24 01:14:15,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (25 of 235 remaining) [2023-11-24 01:14:15,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (24 of 235 remaining) [2023-11-24 01:14:15,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (23 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONDATA_RACE (22 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONDATA_RACE (21 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONDATA_RACE (20 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONDATA_RACE (19 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONDATA_RACE (18 of 235 remaining) [2023-11-24 01:14:15,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONDATA_RACE (17 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONDATA_RACE (16 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONDATA_RACE (15 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONDATA_RACE (14 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONDATA_RACE (13 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONDATA_RACE (12 of 235 remaining) [2023-11-24 01:14:15,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONDATA_RACE (11 of 235 remaining) [2023-11-24 01:14:15,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONDATA_RACE (10 of 235 remaining) [2023-11-24 01:14:15,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONDATA_RACE (9 of 235 remaining) [2023-11-24 01:14:15,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONDATA_RACE (8 of 235 remaining) [2023-11-24 01:14:15,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONDATA_RACE (7 of 235 remaining) [2023-11-24 01:14:15,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONDATA_RACE (6 of 235 remaining) [2023-11-24 01:14:15,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONDATA_RACE (5 of 235 remaining) [2023-11-24 01:14:15,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONDATA_RACE (4 of 235 remaining) [2023-11-24 01:14:15,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONDATA_RACE (3 of 235 remaining) [2023-11-24 01:14:15,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONDATA_RACE (2 of 235 remaining) [2023-11-24 01:14:15,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONDATA_RACE (1 of 235 remaining) [2023-11-24 01:14:15,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONDATA_RACE (0 of 235 remaining) [2023-11-24 01:14:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 01:14:15,974 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-24 01:14:15,976 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-24 01:14:15,977 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 01:14:15,977 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 01:14:16,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 01:14:16,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 01:14:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:16,187 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-24 01:14:16,192 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-24 01:14:16,210 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 01:14:16,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == StealerThread1of2ForFork0 ======== [2023-11-24 01:14:16,211 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;@1bf28a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:16,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-24 01:14:20,483 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-24 01:14:20,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 931878958, now seen corresponding path program 1 times [2023-11-24 01:14:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728511445] [2023-11-24 01:14:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:20,563 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-24 01:14:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728511445] [2023-11-24 01:14:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728511445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 01:14:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38907408] [2023-11-24 01:14:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:20,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:14:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:14:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 01:14:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:20,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:20,568 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-24 01:14:20,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 01:14:21,892 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-24 01:14:21,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -321027789, now seen corresponding path program 1 times [2023-11-24 01:14:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:21,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824170602] [2023-11-24 01:14:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:22,063 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-24 01:14:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824170602] [2023-11-24 01:14:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824170602] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132621877] [2023-11-24 01:14:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:22,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:22,076 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-24 01:14:22,104 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-24 01:14:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:22,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:14:22,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:22,360 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-24 01:14:22,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:22,392 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-24 01:14:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132621877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:22,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 01:14:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367567581] [2023-11-24 01:14:22,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:14:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:14:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:14:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:22,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:22,397 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-24 01:14:22,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:22,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:22,830 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-24 01:14:23,019 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-24 01:14:23,020 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-24 01:14:23,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 942156243, now seen corresponding path program 2 times [2023-11-24 01:14:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669876998] [2023-11-24 01:14:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:23,249 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-24 01:14:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669876998] [2023-11-24 01:14:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669876998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92531801] [2023-11-24 01:14:23,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 01:14:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:23,251 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-24 01:14:23,272 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-24 01:14:23,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 01:14:23,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 01:14:23,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 01:14:23,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:23,562 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-24 01:14:23,573 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-24 01:14:23,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:14:23,593 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-24 01:14:23,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:14:23,614 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-24 01:14:23,632 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-24 01:14:23,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:14:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92531801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:14:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-24 01:14:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204993690] [2023-11-24 01:14:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 01:14:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:23,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 01:14:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-24 01:14:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:23,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:23,637 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-24 01:14:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:43,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:43,808 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-24 01:14:43,808 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-24 01:14:43,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -158451563, now seen corresponding path program 1 times [2023-11-24 01:14:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370268761] [2023-11-24 01:14:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:44,168 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-24 01:14:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370268761] [2023-11-24 01:14:44,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370268761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106710911] [2023-11-24 01:14:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:44,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:44,171 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-24 01:14:44,189 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-24 01:14:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:44,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 01:14:44,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:44,574 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-24 01:14:44,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:44,649 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-24 01:14:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106710911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:44,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 01:14:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490526004] [2023-11-24 01:14:44,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 01:14:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 01:14:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 01:14:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:44,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:44,653 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-24 01:14:44,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:44,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:44,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:44,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:45,406 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-24 01:14:45,606 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-24 01:14:45,607 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-24 01:14:45,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1843059712, now seen corresponding path program 2 times [2023-11-24 01:14:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266935419] [2023-11-24 01:14:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:46,423 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-24 01:14:46,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266935419] [2023-11-24 01:14:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266935419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408791565] [2023-11-24 01:14:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:46,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:46,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:46,427 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-24 01:14:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:46,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:56,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 01:14:56,257 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-24 01:14:56,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash -704215065, now seen corresponding path program 1 times [2023-11-24 01:14:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:56,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036606680] [2023-11-24 01:14:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:57,005 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-24 01:14:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036606680] [2023-11-24 01:14:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036606680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048665428] [2023-11-24 01:14:57,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:57,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:57,009 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:57,009 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-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:57,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:06,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 01:15:06,560 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-24 01:15:06,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2042863976, now seen corresponding path program 1 times [2023-11-24 01:15:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334156319] [2023-11-24 01:15:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:07,182 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-24 01:15:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334156319] [2023-11-24 01:15:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334156319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922549507] [2023-11-24 01:15:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:07,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:07,185 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:07,185 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-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:07,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:16,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 01:15:16,643 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-24 01:15:16,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1991185324, now seen corresponding path program 1 times [2023-11-24 01:15:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304473606] [2023-11-24 01:15:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:17,454 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-24 01:15:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304473606] [2023-11-24 01:15:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304473606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:17,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:17,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646177549] [2023-11-24 01:15:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:17,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:17,458 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:17,459 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-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:17,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 01:15:27,235 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-24 01:15:27,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1248694803, now seen corresponding path program 1 times [2023-11-24 01:15:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856182746] [2023-11-24 01:15:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:27,925 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-24 01:15:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856182746] [2023-11-24 01:15:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856182746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879289936] [2023-11-24 01:15:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:27,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:27,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:27,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:27,927 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-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 01:15:37,302 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-24 01:15:37,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1909487336, now seen corresponding path program 1 times [2023-11-24 01:15:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473309197] [2023-11-24 01:15:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:38,049 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-24 01:15:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473309197] [2023-11-24 01:15:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473309197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008913733] [2023-11-24 01:15:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:38,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:38,052 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-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:49,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 01:15:49,172 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-24 01:15:49,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash 672298144, now seen corresponding path program 1 times [2023-11-24 01:15:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962053272] [2023-11-24 01:15:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:16:08,693 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-24 01:16:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:16:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962053272] [2023-11-24 01:16:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962053272] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:16:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753017329] [2023-11-24 01:16:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:16:08,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:16:08,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:16:08,696 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-24 01:16:08,697 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-24 01:16:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:16:09,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-24 01:16:09,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:16:09,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 01:16:09,424 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-24 01:16:09,933 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-24 01:16:10,698 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-24 01:16:11,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-24 01:16:11,230 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-24 01:16:11,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-24 01:16:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:11,726 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-24 01:16:11,909 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-24 01:16:12,512 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-24 01:16:12,960 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-24 01:16:13,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:13,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:13,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:13,781 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-24 01:16:14,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:14,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:14,664 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-24 01:16:14,778 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-24 01:16:14,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:16:15,487 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 01:16:15,487 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-24 01:16:15,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:15,505 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-24 01:16:15,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:15,526 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-24 01:16:15,587 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-24 01:16:15,587 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-24 01:16:15,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:15,598 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-24 01:16:15,619 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-24 01:16:15,627 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-24 01:16:15,652 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse2 (+ 104 |c_~#q~0.offset|)) (.cse0 (= (select .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|)))) (and (or (not .cse0) (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse2))))) (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse2))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse0)))) is different from false [2023-11-24 01:16:15,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse1 (= (select .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|))) (.cse0 (+ 104 |c_~#q~0.offset|))) (and (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse0))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse1) (or (not .cse1) (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse0)))))))) is different from false [2023-11-24 01:16:16,069 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-24 01:16:52,212 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-24 01:16:52,298 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-24 01:16:52,394 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-24 01:16:53,115 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-24 01:16:53,180 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-24 01:16:53,283 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-24 01:16:53,848 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-24 01:16:53,903 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-24 01:16:54,538 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-24 01:16:54,586 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-24 01:16:55,265 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-24 01:16:55,324 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-24 01:16:55,385 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-24 01:16:55,537 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-24 01:16:55,595 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-24 01:16:55,649 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-24 01:16:55,750 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-24 01:16:56,111 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2023-11-24 01:16:56,111 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-24 01:16:56,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:56,129 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-24 01:16:56,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:56,237 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-24 01:16:56,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:56,273 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-24 01:16:56,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:56,319 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-24 01:16:57,633 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-24 01:16:57,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:57,801 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-24 01:16:57,930 INFO L349 Elim1Store]: treesize reduction 89, result has 11.9 percent of original size [2023-11-24 01:16:57,930 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-24 01:16:57,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:57,947 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-24 01:16:57,961 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:16:57,961 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-24 01:16:58,001 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-24 01:16:58,013 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-24 01:16:58,025 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-24 01:16:58,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:58,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:58,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:58,188 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-24 01:16:58,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:58,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:58,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:16:58,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:58,205 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-24 01:16:58,213 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-24 01:16:58,221 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-24 01:16:58,228 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-24 01:16:58,313 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-24 01:16:59,625 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-24 01:16:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753017329] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:16:59,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:16:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 49] total 142 [2023-11-24 01:16:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248690258] [2023-11-24 01:16:59,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:16:59,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-11-24 01:16:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:16:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-11-24 01:16:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=14360, Unknown=134, NotChecked=4940, Total=20022 [2023-11-24 01:16:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:16:59,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:16:59,635 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-24 01:16:59,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:16:59,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:59,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:18:18,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-24 01:18:33,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:18,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-24 01:19:18,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:18,544 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:19:18,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:19:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 370152459, now seen corresponding path program 1 times [2023-11-24 01:19:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:19:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33068726] [2023-11-24 01:19:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:18,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:19:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 280 proven. 1 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2023-11-24 01:19:19,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:19:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33068726] [2023-11-24 01:19:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33068726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:19:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56630419] [2023-11-24 01:19:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:19:19,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:19:19,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-24 01:19:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:20,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 2477 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 01:19:20,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:19:20,137 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-24 01:19:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-11-24 01:19:20,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:19:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56630419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:19:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:19:20,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-24 01:19:20,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904282400] [2023-11-24 01:19:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:19:20,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:19:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:19:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:19:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:19:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:20,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:19:20,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:20,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:28,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-24 01:19:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:28,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:19:28,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:19:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -811873870, now seen corresponding path program 1 times [2023-11-24 01:19:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:19:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657384470] [2023-11-24 01:19:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:19:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 281 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-24 01:19:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:19:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657384470] [2023-11-24 01:19:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657384470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:19:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909586677] [2023-11-24 01:19:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:19:29,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:19:29,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-24 01:19:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:30,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:19:30,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:19:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-24 01:19:30,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:19:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909586677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:19:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:19:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-24 01:19:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944956204] [2023-11-24 01:19:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:19:30,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 01:19:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:19:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 01:19:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 01:19:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:30,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:19:30,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-24 01:19:30,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:30,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:20:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:20:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:36,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-24 01:20:37,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-24 01:20:37,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:20:37,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:20:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1647234432, now seen corresponding path program 1 times [2023-11-24 01:20:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:20:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463498915] [2023-11-24 01:20:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:20:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:20:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:20:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:20:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:20:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463498915] [2023-11-24 01:20:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463498915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:20:38,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:20:38,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-24 01:20:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650462987] [2023-11-24 01:20:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:20:38,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 01:20:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:20:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 01:20:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-24 01:20:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:20:38,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:20:38,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.294117647058822) internal successors, (311), 17 states have internal predecessors, (311), 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-24 01:20:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:20:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:20:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:20:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:38,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:20:46,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 01:20:46,508 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:20:46,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:20:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1284069585, now seen corresponding path program 1 times [2023-11-24 01:20:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:20:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485409498] [2023-11-24 01:20:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:20:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:20:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:20:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-24 01:20:50,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:20:50,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485409498] [2023-11-24 01:20:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485409498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:20:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:20:50,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-24 01:20:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758548977] [2023-11-24 01:20:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:20:50,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 01:20:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:20:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 01:20:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-11-24 01:20:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:20:50,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:20:50,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 19.76923076923077) internal successors, (257), 14 states have internal predecessors, (257), 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-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:20:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:22,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-24 01:21:22,597 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:22,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash 831318663, now seen corresponding path program 1 times [2023-11-24 01:21:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883170163] [2023-11-24 01:21:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-24 01:21:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883170163] [2023-11-24 01:21:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883170163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:21:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:21:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:21:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463193640] [2023-11-24 01:21:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:21:23,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:21:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:21:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:21:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:21:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:23,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:21:23,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 6 states have internal predecessors, (341), 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-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:23,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:23,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:23,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:23,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:30,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-24 01:21:30,049 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:30,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash -362378850, now seen corresponding path program 1 times [2023-11-24 01:21:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16089401] [2023-11-24 01:21:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-24 01:21:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16089401] [2023-11-24 01:21:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16089401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:21:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:21:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 01:21:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565557519] [2023-11-24 01:21:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:21:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:21:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:21:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:21:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:21:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:32,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:21:32,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 39.55555555555556) internal successors, (356), 10 states have internal predecessors, (356), 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-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:32,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:21:42,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 01:21:42,003 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:42,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 701335744, now seen corresponding path program 1 times [2023-11-24 01:21:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215533636] [2023-11-24 01:21:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:21:48,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:48,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215533636] [2023-11-24 01:21:48,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215533636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:21:48,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160826805] [2023-11-24 01:21:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:48,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:21:48,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:21:48,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:21:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-24 01:21:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:49,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 139 conjunts are in the unsatisfiable core [2023-11-24 01:21:49,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:21:49,245 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 01:21:49,245 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-24 01:21:49,945 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-24 01:21:50,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 01:21:50,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 01:21:50,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 01:21:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 01:21:50,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 01:21:51,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:21:51,438 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 30 treesize of output 21 [2023-11-24 01:21:52,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:21:52,582 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 30 treesize of output 21 [2023-11-24 01:21:53,602 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 01:21:53,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2023-11-24 01:21:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-24 01:21:54,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:21:54,400 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 01:21:54,400 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-24 01:21:54,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:21:54,416 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-24 01:21:54,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:21:54,430 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-24 01:21:54,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:21:54,500 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 178 treesize of output 172 [2023-11-24 01:21:54,514 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-24 01:21:54,527 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-24 01:21:55,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-24 01:22:14,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse3 (select .cse0 |c_~#q~0.base|))) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_8708))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))))) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_8705 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse5 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (= (select .cse6 .cse2) 0))))))) is different from false [2023-11-24 01:22:14,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse3 (select .cse0 |c_~#q~0.base|))) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_8708))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse5 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (= (select .cse6 .cse2) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))))))))) is different from false [2023-11-24 01:22:14,966 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8708))) (or (not (= 0 (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0))) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 01:22:15,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= 0 (select .cse1 .cse3)))))) (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8708))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1))))))))))) is different from false [2023-11-24 01:22:17,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse3 (select .cse0 |c_~#q~0.base|))) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_8708))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse6 .cse2) 0) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse5 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))))) is different from false [2023-11-24 01:22:17,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse1 .cse3) 0) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8708))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 01:22:19,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_8702 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8702) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse3 (select .cse0 |c_~#q~0.base|))) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_8708))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))))) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_8702 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8702) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse6 .cse2) 0) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse5 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))))) is different from false [2023-11-24 01:22:19,749 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8702 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8702) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (= (select .cse1 .cse2) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse3 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))))))) (forall ((v_ArrVal_8702 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8702) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_8708))) (or (not (= 0 (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0))) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse2 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1)))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 01:22:20,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8708))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1))))))))))) is different from false [2023-11-24 01:22:20,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_ArrVal_8708 Int)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8708)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))) (= (select .cse1 .cse3) 0) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_DerPreprocessor_13 Int) (v_ArrVal_8708 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8708))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_13)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) (+ (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 1))))))))))) is different from false [2023-11-24 01:22:20,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:20,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 68 [2023-11-24 01:22:20,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:20,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2682 treesize of output 2656 [2023-11-24 01:22:20,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:20,660 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 769 treesize of output 735 [2023-11-24 01:22:20,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:20,686 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 786 treesize of output 774 [2023-11-24 01:22:21,834 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 6 treesize of output 4 [2023-11-24 01:22:22,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:22,539 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 276 treesize of output 280 [2023-11-24 01:22:25,154 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 6 treesize of output 4 [2023-11-24 01:22:25,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:25,293 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 37 treesize of output 41 [2023-11-24 01:22:25,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 01:22:25,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 01:22:25,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 01:22:25,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:25,572 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 140 treesize of output 132 [2023-11-24 01:22:25,577 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 117 treesize of output 115 [2023-11-24 01:22:25,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:22:25,641 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:22:25,641 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 1 [2023-11-24 01:22:25,659 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-24 01:22:25,660 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 53 treesize of output 50 [2023-11-24 01:22:25,703 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-24 01:22:25,703 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 77 treesize of output 74 [2023-11-24 01:22:25,733 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-24 01:22:25,733 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 66 treesize of output 65 [2023-11-24 01:22:25,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2023-11-24 01:22:25,793 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-24 01:22:25,793 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 359 treesize of output 1 [2023-11-24 01:22:25,810 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:22:25,810 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-11-24 01:22:25,818 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:22:25,819 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 1 [2023-11-24 01:22:25,834 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:22:25,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 275 treesize of output 1 [2023-11-24 01:22:25,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:25,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 115 [2023-11-24 01:22:25,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:22:25,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:22:25,900 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-24 01:22:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3880 treesize of output 3560 [2023-11-24 01:22:25,962 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 1700 treesize of output 1644 [2023-11-24 01:22:25,986 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 1644 treesize of output 1612 [2023-11-24 01:22:26,059 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 362 treesize of output 344 [2023-11-24 01:22:32,167 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 861 treesize of output 831 [2023-11-24 01:22:32,592 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 01:22:32,594 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 4979 treesize of output 4667 [2023-11-24 01:22:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 58 not checked. [2023-11-24 01:22:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160826805] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:22:34,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:22:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 50] total 136 [2023-11-24 01:22:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361922200] [2023-11-24 01:22:34,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:22:34,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-11-24 01:22:34,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:22:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-11-24 01:22:34,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=15175, Unknown=51, NotChecked=2570, Total=18360 [2023-11-24 01:22:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:22:34,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:22:34,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 136 states have (on average 6.514705882352941) internal successors, (886), 136 states have internal predecessors, (886), 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-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:22:34,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:23:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:23:31,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-24 01:23:32,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:23:32,073 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:23:32,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:23:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 17998964, now seen corresponding path program 1 times [2023-11-24 01:23:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:23:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314816174] [2023-11-24 01:23:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:23:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:23:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:23:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:23:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:23:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314816174] [2023-11-24 01:23:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314816174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:23:32,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:23:32,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:23:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964807774] [2023-11-24 01:23:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:23:32,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 01:23:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:23:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 01:23:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 01:23:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:23:32,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:23:32,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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-24 01:23:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:23:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:23:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:23:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:32,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:23:32,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:23:32,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15