./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 20174008 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 11:25:18,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 11:25:18,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 11:25:18,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 11:25:18,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 11:25:18,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 11:25:18,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 11:25:18,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 11:25:18,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 11:25:18,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 11:25:18,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 11:25:18,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 11:25:18,849 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 11:25:18,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 11:25:18,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 11:25:18,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 11:25:18,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 11:25:18,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 11:25:18,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 11:25:18,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 11:25:18,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 11:25:18,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 11:25:18,854 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 11:25:18,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 11:25:18,854 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 11:25:18,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 11:25:18,855 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 11:25:18,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 11:25:18,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 11:25:18,856 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 11:25:18,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 11:25:18,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 11:25:18,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 11:25:18,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 11:25:18,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 11:25:18,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 11:25:18,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 11:25:18,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 11:25:18,858 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 11:25:18,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 11:25:18,858 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 11:25:18,859 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 11:25:18,859 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 11:25:18,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2023-11-24 11:25:19,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 11:25:19,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 11:25:19,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 11:25:19,110 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 11:25:19,110 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 11:25:19,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-24 11:25:20,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 11:25:20,576 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 11:25:20,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-24 11:25:20,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c624add7a/45114336385647ef8ced0cd8fef0874d/FLAGb756288ed [2023-11-24 11:25:20,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c624add7a/45114336385647ef8ced0cd8fef0874d [2023-11-24 11:25:20,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 11:25:20,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 11:25:20,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 11:25:20,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 11:25:20,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 11:25:20,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:25:20" (1/1) ... [2023-11-24 11:25:20,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cad071e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:20, skipping insertion in model container [2023-11-24 11:25:20,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:25:20" (1/1) ... [2023-11-24 11:25:20,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 11:25:21,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 11:25:21,246 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 11:25:21,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 11:25:21,419 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 11:25:21,419 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 11:25:21,424 INFO L206 MainTranslator]: Completed translation [2023-11-24 11:25:21,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21 WrapperNode [2023-11-24 11:25:21,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 11:25:21,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 11:25:21,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 11:25:21,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 11:25:21,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,565 INFO L138 Inliner]: procedures = 490, calls = 133, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 3341 [2023-11-24 11:25:21,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 11:25:21,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 11:25:21,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 11:25:21,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 11:25:21,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 11:25:21,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 11:25:21,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 11:25:21,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 11:25:21,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (1/1) ... [2023-11-24 11:25:21,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 11:25:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:21,861 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 11:25:21,896 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 11:25:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-11-24 11:25:21,936 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-11-24 11:25:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 11:25:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 11:25:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 11:25:21,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 11:25:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 11:25:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 11:25:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 11:25:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 11:25:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 11:25:21,940 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 11:25:22,215 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 11:25:22,217 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 11:25:24,583 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 11:25:25,644 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 11:25:25,644 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-24 11:25:25,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:25:25 BoogieIcfgContainer [2023-11-24 11:25:25,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 11:25:25,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 11:25:25,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 11:25:25,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 11:25:25,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:25:20" (1/3) ... [2023-11-24 11:25:25,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151253c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:25:25, skipping insertion in model container [2023-11-24 11:25:25,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:25:21" (2/3) ... [2023-11-24 11:25:25,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151253c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:25:25, skipping insertion in model container [2023-11-24 11:25:25,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:25:25" (3/3) ... [2023-11-24 11:25:25,655 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-11-24 11:25:25,662 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 11:25:25,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 11:25:25,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 256 error locations. [2023-11-24 11:25:25,669 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 11:25:25,844 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 11:25:25,901 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 11:25:25,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 11:25:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:25,921 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 11:25:25,927 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 11:25:25,964 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 11:25:25,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 11:25:25,978 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;@43d47fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 11:25:25,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2023-11-24 11:25:26,009 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 11:25:26,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash -175989322, now seen corresponding path program 1 times [2023-11-24 11:25:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:26,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156500969] [2023-11-24 11:25:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:26,903 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 11:25:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156500969] [2023-11-24 11:25:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156500969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:26,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:25:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601032495] [2023-11-24 11:25:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:26,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:25:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:25:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:25:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:26,931 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:26,931 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 11:25:26,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:26,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 11:25:26,974 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 11:25:26,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 550251739, now seen corresponding path program 1 times [2023-11-24 11:25:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676697595] [2023-11-24 11:25:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:27,259 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 11:25:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676697595] [2023-11-24 11:25:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676697595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:25:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611747454] [2023-11-24 11:25:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:27,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:25:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:25:27,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:25:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:27,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:27,275 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 11:25:27,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:27,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:27,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 11:25:27,478 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 11:25:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2052957850, now seen corresponding path program 1 times [2023-11-24 11:25:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246070694] [2023-11-24 11:25:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:28,111 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 11:25:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246070694] [2023-11-24 11:25:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246070694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:28,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:25:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610273446] [2023-11-24 11:25:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:28,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:25:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:28,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:25:28,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:25:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:28,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:28,118 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 11:25:28,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 11:25:28,285 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 11:25:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -926548352, now seen corresponding path program 1 times [2023-11-24 11:25:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:28,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478669894] [2023-11-24 11:25:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:28,731 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 11:25:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478669894] [2023-11-24 11:25:28,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478669894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:28,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:28,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:25:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353678499] [2023-11-24 11:25:28,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:28,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:25:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:25:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:25:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:28,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:28,736 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 11:25:28,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:28,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 11:25:29,682 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 11:25:29,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -531652095, now seen corresponding path program 1 times [2023-11-24 11:25:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980795441] [2023-11-24 11:25:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:29,781 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 11:25:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980795441] [2023-11-24 11:25:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980795441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 11:25:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196252558] [2023-11-24 11:25:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 11:25:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 11:25:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 11:25:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:29,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:29,788 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 11:25:29,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:29,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 11:25:29,862 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 11:25:29,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -686131786, now seen corresponding path program 1 times [2023-11-24 11:25:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33484797] [2023-11-24 11:25:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:30,017 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 11:25:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33484797] [2023-11-24 11:25:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33484797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:25:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475534757] [2023-11-24 11:25:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:25:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:30,082 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 11:25:30,083 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 11:25:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:30,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 11:25:30,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:25:30,319 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 11:25:30,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:25:30,360 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 11:25:30,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475534757] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:25:30,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:25:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 11:25:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374526561] [2023-11-24 11:25:30,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:25:30,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 11:25:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:30,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 11:25:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 11:25:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:30,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:30,367 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 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:30,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:25:30,489 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 11:25:30,675 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 11:25:30,676 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 11:25:30,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1739229462, now seen corresponding path program 2 times [2023-11-24 11:25:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965339144] [2023-11-24 11:25:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:30,961 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 11:25:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965339144] [2023-11-24 11:25:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965339144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:25:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342778967] [2023-11-24 11:25:30,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 11:25:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:25:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:30,977 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 11:25:31,012 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 11:25:32,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 11:25:32,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 11:25:32,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 11:25:32,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:25:32,310 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 11:25:32,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:25:32,395 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 11:25:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342778967] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:25:32,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:25:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 11:25:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220520154] [2023-11-24 11:25:32,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:25:32,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 11:25:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 11:25:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 11:25:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:32,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:32,400 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 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:25:32,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:25:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:25:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:25:32,566 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 11:25:32,752 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 11:25:32,753 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 11:25:32,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1912732481, now seen corresponding path program 3 times [2023-11-24 11:25:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:32,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480744153] [2023-11-24 11:25:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 11:25:32,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 11:25:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 11:25:32,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 11:25:32,921 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 11:25:32,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (234 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (233 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (232 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (231 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (230 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (229 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (228 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (227 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (226 of 235 remaining) [2023-11-24 11:25:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232ASSERT_VIOLATIONDATA_RACE (225 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233ASSERT_VIOLATIONDATA_RACE (219 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONDATA_RACE (218 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONDATA_RACE (217 of 235 remaining) [2023-11-24 11:25:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONDATA_RACE (216 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONDATA_RACE (215 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONDATA_RACE (214 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (213 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONDATA_RACE (212 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (211 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (210 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (209 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (208 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (207 of 235 remaining) [2023-11-24 11:25:32,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONDATA_RACE (206 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONDATA_RACE (205 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONDATA_RACE (203 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONDATA_RACE (202 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONDATA_RACE (201 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONDATA_RACE (200 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONDATA_RACE (199 of 235 remaining) [2023-11-24 11:25:32,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (198 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (197 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194ASSERT_VIOLATIONDATA_RACE (196 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (195 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (194 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195ASSERT_VIOLATIONDATA_RACE (193 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (192 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (191 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (190 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (189 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198ASSERT_VIOLATIONDATA_RACE (187 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199ASSERT_VIOLATIONDATA_RACE (186 of 235 remaining) [2023-11-24 11:25:32,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (185 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (184 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196ASSERT_VIOLATIONDATA_RACE (183 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (182 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197ASSERT_VIOLATIONDATA_RACE (181 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229ASSERT_VIOLATIONDATA_RACE (180 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200ASSERT_VIOLATIONDATA_RACE (179 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201ASSERT_VIOLATIONDATA_RACE (178 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203ASSERT_VIOLATIONDATA_RACE (177 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204ASSERT_VIOLATIONDATA_RACE (176 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202ASSERT_VIOLATIONDATA_RACE (175 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (174 of 235 remaining) [2023-11-24 11:25:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (173 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (172 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (171 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (170 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (169 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (168 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (167 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (166 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (165 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230ASSERT_VIOLATIONDATA_RACE (164 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205ASSERT_VIOLATIONDATA_RACE (163 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (162 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231ASSERT_VIOLATIONDATA_RACE (161 of 235 remaining) [2023-11-24 11:25:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (160 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (159 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206ASSERT_VIOLATIONDATA_RACE (158 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207ASSERT_VIOLATIONDATA_RACE (157 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (155 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (154 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (153 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (152 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (151 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (150 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (149 of 235 remaining) [2023-11-24 11:25:32,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208ASSERT_VIOLATIONDATA_RACE (148 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209ASSERT_VIOLATIONDATA_RACE (147 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211ASSERT_VIOLATIONDATA_RACE (146 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212ASSERT_VIOLATIONDATA_RACE (145 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210ASSERT_VIOLATIONDATA_RACE (144 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (143 of 235 remaining) [2023-11-24 11:25:32,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (142 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213ASSERT_VIOLATIONDATA_RACE (141 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (140 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (139 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (138 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (137 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214ASSERT_VIOLATIONDATA_RACE (136 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217ASSERT_VIOLATIONDATA_RACE (135 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218ASSERT_VIOLATIONDATA_RACE (134 of 235 remaining) [2023-11-24 11:25:32,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (133 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (132 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (131 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215ASSERT_VIOLATIONDATA_RACE (130 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (129 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (128 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (127 of 235 remaining) [2023-11-24 11:25:32,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (126 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (125 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (124 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (123 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216ASSERT_VIOLATIONDATA_RACE (122 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (121 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (120 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (119 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (118 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (117 of 235 remaining) [2023-11-24 11:25:32,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (116 of 235 remaining) [2023-11-24 11:25:32,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (115 of 235 remaining) [2023-11-24 11:25:32,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (114 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (113 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219ASSERT_VIOLATIONDATA_RACE (112 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220ASSERT_VIOLATIONDATA_RACE (111 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222ASSERT_VIOLATIONDATA_RACE (110 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223ASSERT_VIOLATIONDATA_RACE (109 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221ASSERT_VIOLATIONDATA_RACE (108 of 235 remaining) [2023-11-24 11:25:32,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (107 of 235 remaining) [2023-11-24 11:25:32,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (106 of 235 remaining) [2023-11-24 11:25:32,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224ASSERT_VIOLATIONDATA_RACE (105 of 235 remaining) [2023-11-24 11:25:32,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (104 of 235 remaining) [2023-11-24 11:25:32,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (103 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (102 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (101 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (100 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (99 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (98 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (97 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (96 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (95 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (94 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (93 of 235 remaining) [2023-11-24 11:25:32,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (92 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (91 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONDATA_RACE (90 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONDATA_RACE (89 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONDATA_RACE (88 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (87 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (86 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225ASSERT_VIOLATIONDATA_RACE (85 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226ASSERT_VIOLATIONDATA_RACE (84 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (83 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONDATA_RACE (82 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (81 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (80 of 235 remaining) [2023-11-24 11:25:32,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (79 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (78 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (77 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227ASSERT_VIOLATIONDATA_RACE (76 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228ASSERT_VIOLATIONDATA_RACE (75 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONDATA_RACE (74 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONDATA_RACE (73 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (72 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (71 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONDATA_RACE (70 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONDATA_RACE (69 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONDATA_RACE (68 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONDATA_RACE (67 of 235 remaining) [2023-11-24 11:25:32,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONDATA_RACE (66 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (65 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (64 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONDATA_RACE (63 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (62 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (61 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (60 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONDATA_RACE (59 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONDATA_RACE (58 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONDATA_RACE (57 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (56 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (55 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONDATA_RACE (54 of 235 remaining) [2023-11-24 11:25:32,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (53 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (52 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (51 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (50 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (49 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (48 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONDATA_RACE (47 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (46 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (45 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (44 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONDATA_RACE (43 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (42 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONDATA_RACE (41 of 235 remaining) [2023-11-24 11:25:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONDATA_RACE (40 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONDATA_RACE (39 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONDATA_RACE (38 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONDATA_RACE (37 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (36 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (35 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (34 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONDATA_RACE (33 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (32 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (31 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONDATA_RACE (30 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (29 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONDATA_RACE (28 of 235 remaining) [2023-11-24 11:25:32,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (27 of 235 remaining) [2023-11-24 11:25:32,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (26 of 235 remaining) [2023-11-24 11:25:32,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (25 of 235 remaining) [2023-11-24 11:25:32,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (24 of 235 remaining) [2023-11-24 11:25:32,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (23 of 235 remaining) [2023-11-24 11:25:32,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONDATA_RACE (22 of 235 remaining) [2023-11-24 11:25:32,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONDATA_RACE (21 of 235 remaining) [2023-11-24 11:25:32,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONDATA_RACE (20 of 235 remaining) [2023-11-24 11:25:32,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONDATA_RACE (19 of 235 remaining) [2023-11-24 11:25:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONDATA_RACE (18 of 235 remaining) [2023-11-24 11:25:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONDATA_RACE (17 of 235 remaining) [2023-11-24 11:25:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONDATA_RACE (16 of 235 remaining) [2023-11-24 11:25:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONDATA_RACE (15 of 235 remaining) [2023-11-24 11:25:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONDATA_RACE (14 of 235 remaining) [2023-11-24 11:25:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONDATA_RACE (13 of 235 remaining) [2023-11-24 11:25:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONDATA_RACE (12 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONDATA_RACE (11 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONDATA_RACE (10 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONDATA_RACE (9 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONDATA_RACE (8 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONDATA_RACE (7 of 235 remaining) [2023-11-24 11:25:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONDATA_RACE (6 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONDATA_RACE (5 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONDATA_RACE (4 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONDATA_RACE (3 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONDATA_RACE (2 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONDATA_RACE (1 of 235 remaining) [2023-11-24 11:25:32,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONDATA_RACE (0 of 235 remaining) [2023-11-24 11:25:32,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 11:25:32,962 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-24 11:25:32,964 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 11:25:32,964 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 11:25:32,964 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 11:25:33,168 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 11:25:33,184 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 11:25:33,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 11:25:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:33,185 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 11:25:33,191 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 11:25:33,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == StealerThread1of2ForFork0 ======== [2023-11-24 11:25:33,191 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;@43d47fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 11:25:33,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-24 11:25:33,216 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 11:25:36,702 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 11:25:36,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1472367488, now seen corresponding path program 1 times [2023-11-24 11:25:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570974678] [2023-11-24 11:25:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:36,789 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 11:25:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570974678] [2023-11-24 11:25:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570974678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:25:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 11:25:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425678856] [2023-11-24 11:25:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:36,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 11:25:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 11:25:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 11:25:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:36,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:36,794 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 11:25:36,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:37,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 11:25:37,943 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 11:25:37,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2071005469, now seen corresponding path program 1 times [2023-11-24 11:25:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458602683] [2023-11-24 11:25:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:38,077 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 11:25:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458602683] [2023-11-24 11:25:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458602683] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:25:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135074375] [2023-11-24 11:25:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:25:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:38,092 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 11:25:38,113 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 11:25:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:38,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 11:25:38,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:25:38,400 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 11:25:38,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:25:38,432 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 11:25:38,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135074375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:25:38,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:25:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 11:25:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932074599] [2023-11-24 11:25:38,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:25:38,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 11:25:38,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 11:25:38,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 11:25:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:38,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:38,437 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 11:25:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:25:38,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 11:25:38,930 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 11:25:38,930 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 11:25:38,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:25:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1259524125, now seen corresponding path program 2 times [2023-11-24 11:25:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:25:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625795011] [2023-11-24 11:25:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:25:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:25:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:25:39,308 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 11:25:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:25:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625795011] [2023-11-24 11:25:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625795011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:25:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990197083] [2023-11-24 11:25:39,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 11:25:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:25:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:25:39,320 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 11:25:39,321 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 11:25:39,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 11:25:39,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 11:25:39,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 11:25:39,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:25:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 11:25:39,659 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 11:25:39,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:25:39,681 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 11:25:39,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:25:39,705 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 11:25:39,724 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 11:25:39,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 11:25:39,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990197083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:25:39,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 11:25:39,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-24 11:25:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017686758] [2023-11-24 11:25:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:25:39,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 11:25:39,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:25:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 11:25:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-24 11:25:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:25:39,730 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:25:39,730 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 11:25:39,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:25:39,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:25:39,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:00,699 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 11:26:00,885 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 11:26:00,885 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 11:26:00,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash 810464458, now seen corresponding path program 1 times [2023-11-24 11:26:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:00,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037780879] [2023-11-24 11:26:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:01,198 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 11:26:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037780879] [2023-11-24 11:26:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037780879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:26:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894857563] [2023-11-24 11:26:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:26:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:26:01,200 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 11:26:01,216 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 11:26:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:01,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 11:26:01,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:26:01,628 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 11:26:01,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:26:01,735 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 11:26:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894857563] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:26:01,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:26:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 11:26:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454060091] [2023-11-24 11:26:01,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:26:01,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 11:26:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:01,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 11:26:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 11:26:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:01,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:01,760 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 11:26:01,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:01,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:01,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:01,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:02,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-24 11:26:02,956 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 11:26:02,956 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 11:26:02,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1188936466, now seen corresponding path program 2 times [2023-11-24 11:26:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765208114] [2023-11-24 11:26:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:03,700 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 11:26:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765208114] [2023-11-24 11:26:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765208114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599211459] [2023-11-24 11:26:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:03,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:03,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:03,705 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 11:26:03,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:03,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:03,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:03,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:03,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:13,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 11:26:13,707 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 11:26:13,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 894600756, now seen corresponding path program 1 times [2023-11-24 11:26:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140484301] [2023-11-24 11:26:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:14,427 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 11:26:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140484301] [2023-11-24 11:26:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140484301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:14,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:14,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011792096] [2023-11-24 11:26:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:14,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:14,432 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:14,433 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 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:14,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 11:26:23,905 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 11:26:23,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -551060470, now seen corresponding path program 1 times [2023-11-24 11:26:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982579696] [2023-11-24 11:26:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:24,747 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 11:26:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982579696] [2023-11-24 11:26:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982579696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:24,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:24,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131420117] [2023-11-24 11:26:24,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:24,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:24,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:24,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:24,752 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:24,752 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 11:26:24,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:24,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:24,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:24,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:24,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:24,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:24,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 11:26:34,218 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 11:26:34,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1995204738, now seen corresponding path program 1 times [2023-11-24 11:26:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221781438] [2023-11-24 11:26:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:35,086 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 11:26:35,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221781438] [2023-11-24 11:26:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221781438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:35,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313209776] [2023-11-24 11:26:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:35,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:35,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:35,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:35,091 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 11:26:35,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:35,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:35,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:35,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:35,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:35,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:35,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:35,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 11:26:44,775 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 11:26:44,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1859910400, now seen corresponding path program 1 times [2023-11-24 11:26:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:44,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129763479] [2023-11-24 11:26:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:45,493 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 11:26:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129763479] [2023-11-24 11:26:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129763479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:45,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596901512] [2023-11-24 11:26:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:45,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:45,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:45,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:45,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:45,497 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 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:45,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 11:26:55,272 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 11:26:55,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:26:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -695868283, now seen corresponding path program 1 times [2023-11-24 11:26:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:26:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871181903] [2023-11-24 11:26:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:26:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:26:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:26:55,913 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 11:26:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:26:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871181903] [2023-11-24 11:26:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871181903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:26:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:26:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:26:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612203134] [2023-11-24 11:26:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:26:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:26:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:26:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:26:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:26:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:26:55,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:26:55,918 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 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:26:55,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:27:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:27:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:27:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:27:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:27:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:27:06,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 11:27:06,310 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 11:27:06,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:27:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2128059407, now seen corresponding path program 1 times [2023-11-24 11:27:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:27:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806229137] [2023-11-24 11:27:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:27:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:27:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:27:25,845 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 11:27:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:27:25,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806229137] [2023-11-24 11:27:25,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806229137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:27:25,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746547891] [2023-11-24 11:27:25,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:27:25,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:27:25,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:27:25,855 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 11:27:25,856 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 11:27:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:27:26,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-24 11:27:26,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:27:26,525 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 11:27:26,526 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 11:27:27,028 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 11:27:27,766 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 11:27:28,200 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 11:27:28,337 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 11:27:28,494 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 11:27:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 11:27:28,923 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 11:27:29,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-24 11:27:29,643 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 11:27:30,154 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 11:27:31,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 11:27:31,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 11:27:31,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:27:31,106 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 11:27:31,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 11:27:31,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:27:31,994 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 11:27:32,083 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 11:27:32,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:27:32,692 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 11:27:32,693 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 11:27:32,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:27:32,713 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 11:27:32,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:27:32,732 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 11:27:32,810 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-24 11:27:32,810 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 11:27:32,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:27:32,820 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 11:27:32,839 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 11:27:32,847 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 11:27:32,869 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 11:27:32,909 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 11:27:33,274 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 11:28:06,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (< 0 (select .cse4 (+ 104 |c_~#q~0.offset|))) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (forall ((v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))) is different from false [2023-11-24 11:28:08,784 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 11:28:08,864 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 11:28:08,993 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 11:28:09,814 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 11:28:09,878 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 11:28:09,985 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 11:28:10,693 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 11:28:10,761 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 11:28:11,429 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 11:28:11,476 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 11:28:12,182 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 11:28:12,236 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 11:28:12,284 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 11:28:12,409 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 11:28:12,456 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 11:28:12,503 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 11:28:12,600 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 11:28:12,967 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2023-11-24 11:28:12,967 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 11:28:13,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:13,001 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 11:28:13,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:13,184 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 11:28:13,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:13,218 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 11:28:13,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:13,269 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 11:28:14,651 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 11:28:14,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:14,828 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 11:28:14,957 INFO L349 Elim1Store]: treesize reduction 89, result has 11.9 percent of original size [2023-11-24 11:28:14,961 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 11:28:14,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:14,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:14,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:14,987 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 11:28:15,004 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 11:28:15,005 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 11:28:15,048 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 11:28:15,062 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 11:28:15,077 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 11:28:15,267 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:15,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:15,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:15,277 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 11:28:15,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:15,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:15,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:28:15,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:28:15,300 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 11:28:15,311 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 11:28:15,320 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 11:28:15,333 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 11:28:15,438 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 11:28:16,794 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 11:28:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746547891] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:28:16,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:28:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 49] total 142 [2023-11-24 11:28:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768010757] [2023-11-24 11:28:16,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:28:16,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-11-24 11:28:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:28:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-11-24 11:28:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=14198, Unknown=61, NotChecked=5180, Total=20022 [2023-11-24 11:28:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:28:16,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:28:16,809 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 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:28:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:29:45,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:30:34,227 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 11:30:34,425 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 11:30:34,425 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 11:30:34,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:30:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1646655175, now seen corresponding path program 1 times [2023-11-24 11:30:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:30:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050797177] [2023-11-24 11:30:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:30:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:30:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:30:35,007 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 11:30:35,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:30:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050797177] [2023-11-24 11:30:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050797177] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:30:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791773266] [2023-11-24 11:30:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:30:35,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:30:35,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:30:35,011 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 11:30:35,012 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 11:30:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:30:35,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 2477 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 11:30:35,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:30:35,739 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 11:30:36,000 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 11:30:36,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 11:30:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791773266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:30:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 11:30:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-24 11:30:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369825540] [2023-11-24 11:30:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:30:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 11:30:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:30:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 11:30:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:30:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:30:36,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:30:36,003 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 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:30:36,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:30:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:41,957 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 11:30:42,141 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 11:30:42,142 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 11:30:42,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:30:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash 725465581, now seen corresponding path program 1 times [2023-11-24 11:30:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:30:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288140403] [2023-11-24 11:30:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:30:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:30:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:30:42,654 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 11:30:42,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:30:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288140403] [2023-11-24 11:30:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288140403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:30:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34664152] [2023-11-24 11:30:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:30:42,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:30:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:30:42,673 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 11:30:42,710 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 11:30:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:30:43,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 11:30:43,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:30:43,715 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 11:30:43,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 11:30:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34664152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:30:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 11:30:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-24 11:30:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778329259] [2023-11-24 11:30:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:30:43,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 11:30:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:30:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 11:30:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 11:30:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:30:43,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:30:43,721 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 11:30:43,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:43,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:30:43,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:31:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:31:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:31:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:31:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:31:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:48,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-24 11:31:48,861 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 11:31:48,861 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 11:31:48,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:31:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 697784534, now seen corresponding path program 1 times [2023-11-24 11:31:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:31:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428291750] [2023-11-24 11:31:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:31:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:31:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:31:50,690 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 11:31:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:31:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428291750] [2023-11-24 11:31:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428291750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:31:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:31:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-24 11:31:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946772574] [2023-11-24 11:31:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:31:50,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 11:31:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:31:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 11:31:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-24 11:31:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:31:50,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:31:50,693 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 11:31:50,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:50,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:31:50,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:31:50,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:31:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:31:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:31:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:31:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:31:58,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 11:31:58,380 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 11:31:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:31:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2011321660, now seen corresponding path program 1 times [2023-11-24 11:31:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:31:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841841187] [2023-11-24 11:31:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:31:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:31:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:32:01,735 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 11:32:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:32:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841841187] [2023-11-24 11:32:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841841187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:32:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:32:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-24 11:32:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407033540] [2023-11-24 11:32:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:32:01,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 11:32:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:32:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 11:32:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-11-24 11:32:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:01,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:32:01,738 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 11:32:01,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:01,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:01,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:01,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:01,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:32:31,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-24 11:32:31,651 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 11:32:31,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:32:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2147417685, now seen corresponding path program 1 times [2023-11-24 11:32:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:32:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462598934] [2023-11-24 11:32:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:32:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:32:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:32:32,392 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 11:32:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:32:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462598934] [2023-11-24 11:32:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462598934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:32:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:32:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:32:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514744716] [2023-11-24 11:32:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:32:32,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 11:32:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:32:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 11:32:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-24 11:32:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:32,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:32:32,395 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 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:32:32,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:32:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-24 11:32:38,250 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 11:32:38,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:32:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1740456866, now seen corresponding path program 1 times [2023-11-24 11:32:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:32:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275791725] [2023-11-24 11:32:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:32:38,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:32:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:32:40,754 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 11:32:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:32:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275791725] [2023-11-24 11:32:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275791725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:32:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:32:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 11:32:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871005936] [2023-11-24 11:32:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:32:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 11:32:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:32:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 11:32:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 11:32:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:40,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:32:40,757 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 11:32:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:40,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:40,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:32:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:32:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:32:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:32:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:32:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:32:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:32:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:32:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 11:32:50,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 11:32:50,594 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 11:32:50,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:32:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1149432964, now seen corresponding path program 1 times [2023-11-24 11:32:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:32:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988741686] [2023-11-24 11:32:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:32:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:32:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:32:57,002 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 11:32:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:32:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988741686] [2023-11-24 11:32:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988741686] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 11:32:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198507722] [2023-11-24 11:32:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:32:57,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 11:32:57,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 11:32:57,004 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 11:32:57,008 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 11:32:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:32:57,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 178 conjunts are in the unsatisfiable core [2023-11-24 11:32:57,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 11:32:57,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 11:32:57,934 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 11:32:58,589 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 11:32:58,813 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 11:32:58,940 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 11:32:59,073 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 11:32:59,280 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 11:32:59,435 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 11:33:00,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:33:00,134 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 11:33:01,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:33:01,792 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 28 treesize of output 30 [2023-11-24 11:33:03,614 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 11:33:03,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 36 [2023-11-24 11:33:04,611 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 11:33:04,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 11:33:04,939 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 11:33:04,940 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 11:33:04,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:33:04,960 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 11:33:04,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:33:04,982 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 11:33:05,060 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-24 11:33:05,060 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 11:33:05,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:33:05,073 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 11:33:05,088 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 11:33:05,095 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 11:33:05,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse1 (+ |c_StealerThread1of2ForFork0_Steal_~h~0#1| 1)) (.cse2 (= (select .cse0 |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 (forall ((v_DerPreprocessor_11 Int)) (< (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse0 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_11)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)) (not .cse2)) (or (forall ((v_DerPreprocessor_12 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_12) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)) .cse2)))) is different from false [2023-11-24 11:33:05,527 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 11:33:39,743 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))) (let ((.cse0 (store |c_#memory_int| |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_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse5 (select .cse4 |c_~#q~0.base|)) (.cse7 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse6 (store .cse5 .cse2 .cse7))) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse6) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse7))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 11:33:40,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 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_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse1 (select .cse0 |c_~#q~0.base|)) (.cse5 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse3 (store .cse1 .cse2 .cse5))) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse5) (not (= 0 (select (select (store .cse0 |c_~#q~0.base| .cse3) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0))))))) (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 ((.cse7 (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 .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse4) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse7 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)))))))))) is different from false [2023-11-24 11:33:40,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 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_#in~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse4 (select .cse0 |c_~#q~0.base|)) (.cse3 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse1 (store .cse4 .cse5 .cse3))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse3) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse4 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0))))))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse7 (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 ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse2) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select .cse7 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))))))))) is different from false [2023-11-24 11:33:58,501 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_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))) (= (select .cse1 .cse3) 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 (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|)) (.cse7 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse6 .cse2 .cse7))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse7)))))))))) is different from false [2023-11-24 11:33:59,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |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 ((.cse2 (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 ((.cse0 (select .cse2 |c_~#q~0.base|))) (or (= (select .cse0 .cse1) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select .cse2 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 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_~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 (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse7 (select .cse4 |c_~#q~0.base|)) (.cse6 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse7 .cse3 .cse6))) (or (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse1 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse6) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0))))))))))) is different from false [2023-11-24 11:34:18,959 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 ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 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_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse7 (select .cse4 |c_~#q~0.base|)) (.cse6 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse7 .cse2 .cse6))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse6) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse7 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0))))))))))) is different from false [2023-11-24 11:34:21,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (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 ((.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))) (or (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse4 (select .cse0 |c_~#q~0.base|)) (.cse3 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse1 (store .cse4 .cse5 .cse3))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse3) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse4 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0))))))))) (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse7 (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 ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse2) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select .cse7 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))))))))) is different from false [2023-11-24 11:34:21,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:21,489 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 139 treesize of output 99 [2023-11-24 11:34:21,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:21,561 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 15719 treesize of output 15301 [2023-11-24 11:34:21,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:21,638 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 1419 treesize of output 1391 [2023-11-24 11:34:21,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:21,672 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 1600 treesize of output 1534 [2023-11-24 11:34:21,809 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 11:34:22,257 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 11:34:22,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:22,276 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 13 treesize of output 17 [2023-11-24 11:34:22,340 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 11:34:22,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:22,362 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 13 treesize of output 17 [2023-11-24 11:34:22,383 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 11:34:22,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:22,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 13 treesize of output 17 [2023-11-24 11:34:22,441 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 11:34:27,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:27,033 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 174 treesize of output 178 [2023-11-24 11:34:27,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:27,189 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 54 treesize of output 54 [2023-11-24 11:34:27,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 11:34:27,224 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 170 treesize of output 122 [2023-11-24 11:34:27,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:34:27,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 11:34:27,256 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-24 11:34:27,257 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 925 treesize of output 885 [2023-11-24 11:34:27,276 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 430 treesize of output 414 [2023-11-24 11:34:27,288 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 342 treesize of output 334 [2023-11-24 11:34:27,431 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 72 treesize of output 68 [2023-11-24 11:34:27,544 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 76 treesize of output 72 [2023-11-24 11:34:27,828 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 11:34:27,828 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 120 treesize of output 110 [2023-11-24 11:34:30,157 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 11:34:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198507722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 11:34:30,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 11:34:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47, 52] total 139 [2023-11-24 11:34:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894582779] [2023-11-24 11:34:30,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 11:34:30,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2023-11-24 11:34:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:34:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2023-11-24 11:34:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=16160, Unknown=272, NotChecked=2120, Total=19182 [2023-11-24 11:34:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:34:30,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:34:30,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 6.374100719424461) internal successors, (886), 139 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 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 11:34:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:35:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:35:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:35:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:35:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:35:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:35:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 11:35:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-24 11:35:55,458 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 11:35:55,651 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 11:35:55,651 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 11:35:55,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 11:35:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1420667690, now seen corresponding path program 1 times [2023-11-24 11:35:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 11:35:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030236899] [2023-11-24 11:35:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 11:35:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 11:35:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 11:35:55,902 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 11:35:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 11:35:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030236899] [2023-11-24 11:35:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030236899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 11:35:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 11:35:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 11:35:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511450358] [2023-11-24 11:35:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 11:35:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 11:35:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 11:35:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 11:35:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 11:35:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 11:35:55,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 11:35:55,906 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 11:35:55,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:35:55,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 11:35:55,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 11:35:55,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 11:35:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 11:35:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 11:35:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-24 11:35:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15