./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:42:43,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:42:43,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 19:42:43,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:42:43,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:42:43,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:42:43,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:42:43,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:42:43,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:42:43,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:42:43,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:42:43,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:42:43,737 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:42:43,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:42:43,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:42:43,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:42:43,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:42:43,740 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 19:42:43,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:42:43,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:42:43,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:42:43,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:42:43,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:42:43,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:42:43,741 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 19:42:43,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:42:43,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:42:43,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:42:43,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:42:43,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:42:43,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:42:43,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:42:43,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:42:43,744 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 19:42:43,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:42:43,744 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:42:43,744 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:42:43,744 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:42:43,751 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 19:42:44,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:42:44,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:42:44,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:42:44,051 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:42:44,051 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:42:44,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-21 19:42:45,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:42:45,354 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:42:45,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-21 19:42:45,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7ce1892f0/73c5cff856e84f658786965077f0853a/FLAGa2f2d73a8 [2023-11-21 19:42:45,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7ce1892f0/73c5cff856e84f658786965077f0853a [2023-11-21 19:42:45,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:42:45,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:42:45,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:42:45,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:42:45,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:42:45,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:45,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebe85a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45, skipping insertion in model container [2023-11-21 19:42:45,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:45,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:42:45,583 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:42:45,783 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:42:45,790 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:42:45,810 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:42:45,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:42:45,922 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:42:45,928 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:42:45,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45 WrapperNode [2023-11-21 19:42:45,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:42:45,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:42:45,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:42:45,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:42:45,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:45,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:45,996 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-21 19:42:45,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:42:45,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:42:45,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:42:45,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:42:46,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,013 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,024 INFO L193 HeapSplitter]: Split 10 memory accesses to 4 slices as follows [3, 4, 1, 2] [2023-11-21 19:42:46,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:42:46,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:42:46,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:42:46,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:42:46,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (1/1) ... [2023-11-21 19:42:46,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:42:46,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:46,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:42:46,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:42:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:42:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 19:42:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 19:42:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 19:42:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-21 19:42:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:42:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 19:42:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 19:42:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 19:42:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-21 19:42:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 19:42:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 19:42:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 19:42:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 19:42:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 19:42:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 19:42:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 19:42:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 19:42:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 19:42:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 19:42:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 19:42:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:42:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:42:46,168 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:42:46,324 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:42:46,326 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:42:46,584 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:42:46,595 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:42:46,595 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:42:46,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:42:46 BoogieIcfgContainer [2023-11-21 19:42:46,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:42:46,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:42:46,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:42:46,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:42:46,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:42:45" (1/3) ... [2023-11-21 19:42:46,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a29ae1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:42:46, skipping insertion in model container [2023-11-21 19:42:46,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:45" (2/3) ... [2023-11-21 19:42:46,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a29ae1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:42:46, skipping insertion in model container [2023-11-21 19:42:46,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:42:46" (3/3) ... [2023-11-21 19:42:46,621 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-21 19:42:46,643 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:42:46,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:42:46,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 19:42:46,656 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:42:46,747 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 19:42:46,792 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:42:46,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:42:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:46,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:42:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 19:42:46,826 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:42:46,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 19:42:46,839 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;@63c343cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:42:46,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:42:47,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:47,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-11-21 19:42:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862386450] [2023-11-21 19:42:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862386450] [2023-11-21 19:42:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862386450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:42:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:42:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:42:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105972007] [2023-11-21 19:42:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:42:47,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:42:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:42:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:42:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:47,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:47,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:42:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:47,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:42:47,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:47,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-21 19:42:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547025000] [2023-11-21 19:42:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:47,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547025000] [2023-11-21 19:42:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547025000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:42:47,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:42:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:42:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281798082] [2023-11-21 19:42:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:42:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:42:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:42:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:42:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:47,966 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:47,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:42:47,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:47,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:48,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:42:48,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:48,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-11-21 19:42:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33357404] [2023-11-21 19:42:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33357404] [2023-11-21 19:42:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33357404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769410216] [2023-11-21 19:42:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:48,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:48,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:42:48,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:42:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:48,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-21 19:42:48,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:48,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 19:42:49,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:42:49,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 19:42:49,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:49,093 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:42:49,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:49,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:42:49,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:49,276 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 43 treesize of output 32 [2023-11-21 19:42:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:49,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:49,308 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:42:49,429 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2))))))) is different from false [2023-11-21 19:42:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:42:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 19:42:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769410216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:53,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 19:42:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066166750] [2023-11-21 19:42:53,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:53,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:42:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:42:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=863, Unknown=13, NotChecked=122, Total=1122 [2023-11-21 19:42:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:53,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:53,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:42:53,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:53,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:53,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:42:54,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 19:42:54,700 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,SelfDestructingSolverStorable2 [2023-11-21 19:42:54,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:54,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-11-21 19:42:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744451735] [2023-11-21 19:42:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744451735] [2023-11-21 19:42:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744451735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825254677] [2023-11-21 19:42:55,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:42:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:55,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:42:55,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 19:42:55,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:42:55,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:42:55,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-21 19:42:55,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:55,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 19:42:55,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:42:55,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 19:42:55,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:55,705 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:42:55,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:55,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:42:55,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:55,902 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 43 treesize of output 32 [2023-11-21 19:42:55,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:55,916 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 43 treesize of output 32 [2023-11-21 19:42:55,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:55,931 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 43 treesize of output 32 [2023-11-21 19:42:55,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:55,948 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 43 treesize of output 32 [2023-11-21 19:42:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:56,029 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 43 treesize of output 32 [2023-11-21 19:42:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:56,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:56,050 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false [2023-11-21 19:42:56,085 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:42:56,187 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:42:56,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:42:56,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 19:42:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-21 19:42:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825254677] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:56,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-21 19:42:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769008083] [2023-11-21 19:42:56,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:56,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 19:42:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 19:42:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=998, Unknown=4, NotChecked=268, Total=1406 [2023-11-21 19:42:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:56,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:56,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:42:56,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:56,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:56,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:42:56,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:42:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:42:57,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 19:42:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:57,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:57,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-11-21 19:42:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:57,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392760057] [2023-11-21 19:42:57,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:57,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392760057] [2023-11-21 19:42:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392760057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400444225] [2023-11-21 19:42:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:58,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:42:58,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 19:42:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:58,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-21 19:42:58,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:58,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:42:58,805 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:42:58,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:42:58,838 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:42:58,838 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 23 treesize of output 23 [2023-11-21 19:42:58,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:42:59,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:42:59,070 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 21 treesize of output 20 [2023-11-21 19:42:59,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:42:59,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:42:59,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:42:59,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:59,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:42:59,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:59,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:42:59,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:59,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:42:59,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:59,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:42:59,447 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 43 treesize of output 32 [2023-11-21 19:42:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:59,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:59,468 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:42:59,490 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:42:59,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse0 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse0 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse0 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse0 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))))) is different from false [2023-11-21 19:42:59,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:42:59,626 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse1 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:42:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-21 19:42:59,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-21 19:42:59,913 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 10 treesize of output 8 [2023-11-21 19:42:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:42:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400444225] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:59,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 38 [2023-11-21 19:42:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163456850] [2023-11-21 19:42:59,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:59,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-21 19:42:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-21 19:42:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=999, Unknown=5, NotChecked=340, Total=1482 [2023-11-21 19:42:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:59,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:59,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 39 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:42:59,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:59,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:59,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:42:59,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:42:59,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:43:02,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 19:43:02,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:02,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:02,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-11-21 19:43:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546301218] [2023-11-21 19:43:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546301218] [2023-11-21 19:43:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546301218] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303362451] [2023-11-21 19:43:02,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:43:02,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:02,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:02,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 19:43:02,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:43:02,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:43:02,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:43:02,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:02,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:03,066 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:43:03,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:43:03,116 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:03,116 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 23 treesize of output 23 [2023-11-21 19:43:03,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:43:03,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:03,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:43:03,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:43:03,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:43:03,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:03,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:43:03,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:43:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:03,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:03,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:03,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:03,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:04,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:04,107 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:04,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:04,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:43:04,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse1 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse1 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse1 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse1 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:43:04,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse2 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse2 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse2 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_546) c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_551) .cse2 v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:04,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-21 19:43:04,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:43:04,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-21 19:43:04,588 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 10 treesize of output 8 [2023-11-21 19:43:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:43:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303362451] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:04,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 45 [2023-11-21 19:43:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143120367] [2023-11-21 19:43:04,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:04,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-21 19:43:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-21 19:43:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1468, Unknown=25, NotChecked=410, Total=2070 [2023-11-21 19:43:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:04,612 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:04,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.422222222222222) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:43:04,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:43:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 19:43:08,019 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-21 19:43:08,218 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,SelfDestructingSolverStorable5 [2023-11-21 19:43:08,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:08,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-11-21 19:43:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:08,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118098114] [2023-11-21 19:43:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118098114] [2023-11-21 19:43:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118098114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40597652] [2023-11-21 19:43:08,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:43:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:08,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 19:43:08,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 19:43:08,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:43:08,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:43:08,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:09,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:09,063 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:43:09,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:43:09,107 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:09,107 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 23 treesize of output 23 [2023-11-21 19:43:09,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:09,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:43:09,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:09,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:43:09,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:43:09,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:09,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 19:43:09,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:43:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:43:09,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:09,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:09,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:09,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:09,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:09,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:09,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:09,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:10,179 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:10,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_674) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:10,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-21 19:43:10,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:43:10,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-21 19:43:10,797 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 10 treesize of output 8 [2023-11-21 19:43:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40597652] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:10,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:10,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 44 [2023-11-21 19:43:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909144015] [2023-11-21 19:43:10,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:10,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-21 19:43:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-21 19:43:10,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1592, Unknown=55, NotChecked=166, Total=1980 [2023-11-21 19:43:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:10,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:10,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.5) internal successors, (154), 45 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:10,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:10,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:10,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:10,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:10,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:43:10,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-11-21 19:43:10,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 19:43:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 19:43:14,496 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-21 19:43:14,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:14,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:14,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1748119725, now seen corresponding path program 4 times [2023-11-21 19:43:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153965076] [2023-11-21 19:43:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153965076] [2023-11-21 19:43:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153965076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50410517] [2023-11-21 19:43:15,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:43:15,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:15,533 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 19:43:15,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:43:15,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:43:15,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:43:15,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:15,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:15,896 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:43:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:43:15,939 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:15,939 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 23 treesize of output 23 [2023-11-21 19:43:16,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:16,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:43:16,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:16,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:43:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:16,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:43:16,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:43:16,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:43:16,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:43:16,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:16,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:16,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:16,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:16,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:16,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:43:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:16,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:16,780 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_796 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_796 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_796 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_796 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:16,802 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3))))) is different from false [2023-11-21 19:43:16,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:16,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_796) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:17,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-21 19:43:17,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:43:17,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-21 19:43:17,189 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 10 treesize of output 8 [2023-11-21 19:43:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:17,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50410517] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:17,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:17,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 44 [2023-11-21 19:43:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093704292] [2023-11-21 19:43:17,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:17,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-21 19:43:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-21 19:43:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1494, Unknown=4, NotChecked=324, Total=1980 [2023-11-21 19:43:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:17,214 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:17,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 19:43:17,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:43:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:43:20,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 19:43:20,887 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,SelfDestructingSolverStorable7 [2023-11-21 19:43:20,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:20,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1504699717, now seen corresponding path program 5 times [2023-11-21 19:43:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276966122] [2023-11-21 19:43:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276966122] [2023-11-21 19:43:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276966122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512223437] [2023-11-21 19:43:21,493 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 19:43:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:21,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:21,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 19:43:21,620 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:43:21,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:43:21,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-21 19:43:21,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:21,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:21,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-21 19:43:21,711 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:21,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 19:43:21,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:22,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 19:43:22,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:22,113 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 21 treesize of output 20 [2023-11-21 19:43:22,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:22,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:43:22,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:22,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:43:22,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:22,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:22,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:22,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:22,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:22,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:22,313 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 43 treesize of output 32 [2023-11-21 19:43:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:22,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:22,331 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:22,350 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:22,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:22,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_917) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:43:22,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-21 19:43:22,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-21 19:43:22,683 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 10 treesize of output 8 [2023-11-21 19:43:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512223437] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:22,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 39 [2023-11-21 19:43:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311008270] [2023-11-21 19:43:22,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:22,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-21 19:43:22,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-21 19:43:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1123, Unknown=4, NotChecked=284, Total=1560 [2023-11-21 19:43:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:22,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:22,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.5128205128205128) internal successors, (137), 40 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:22,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:22,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:43:22,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:43:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:43:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-21 19:43:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:43:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:43:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:43:26,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 19:43:26,024 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-21 19:43:26,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:26,251 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2023-11-21 19:43:26,252 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 19:43:26,257 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:43:26,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:43:26,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:26,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:43:26,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-21 19:43:26,288 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:43:26,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:43:26,289 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;@63c343cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:43:26,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 19:43:26,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:43:26,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1375234035, now seen corresponding path program 1 times [2023-11-21 19:43:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063868005] [2023-11-21 19:43:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063868005] [2023-11-21 19:43:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063868005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962044442] [2023-11-21 19:43:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:26,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:43:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:43:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:43:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:26,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:26,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:43:26,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:43:26,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-21 19:43:26,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:26,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384762863] [2023-11-21 19:43:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384762863] [2023-11-21 19:43:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384762863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:43:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513220146] [2023-11-21 19:43:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:26,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:26,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:43:26,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:43:26,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1614691510, now seen corresponding path program 1 times [2023-11-21 19:43:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410159856] [2023-11-21 19:43:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410159856] [2023-11-21 19:43:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410159856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:43:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725324213] [2023-11-21 19:43:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:26,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:26,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:26,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:26,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:26,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:43:26,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:43:26,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-21 19:43:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457910393] [2023-11-21 19:43:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:43:26,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:43:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:43:26,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:43:26,867 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:43:26,867 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 19:43:26,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 19:43:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 19:43:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-21 19:43:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 19:43:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 19:43:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 19:43:26,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 19:43:26,871 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 19:43:26,872 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 19:43:26,872 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:43:26,872 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 19:43:26,888 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 19:43:26,894 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:43:26,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:43:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:26,916 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:43:26,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-11-21 19:43:26,973 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:43:26,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 19:43:26,973 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;@63c343cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:43:26,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:43:27,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:27,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -672575354, now seen corresponding path program 1 times [2023-11-21 19:43:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525587689] [2023-11-21 19:43:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525587689] [2023-11-21 19:43:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525587689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:27,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:27,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920329734] [2023-11-21 19:43:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:27,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:43:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:27,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:43:27,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:43:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:27,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:27,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 19:43:27,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:27,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1257691790, now seen corresponding path program 1 times [2023-11-21 19:43:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018892038] [2023-11-21 19:43:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018892038] [2023-11-21 19:43:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018892038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:43:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869349581] [2023-11-21 19:43:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:27,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:27,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:27,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:27,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:27,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:27,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 19:43:27,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:27,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash 709812826, now seen corresponding path program 1 times [2023-11-21 19:43:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:27,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045652023] [2023-11-21 19:43:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045652023] [2023-11-21 19:43:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045652023] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742176679] [2023-11-21 19:43:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:27,863 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-21 19:43:27,889 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-21 19:43:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:27,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-21 19:43:27,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:28,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 19:43:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:28,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 19:43:28,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:28,159 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:43:28,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:28,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:43:28,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:28,326 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 43 treesize of output 32 [2023-11-21 19:43:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:28,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:30,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:43:30,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1212 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1212) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:43:32,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:43:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742176679] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:32,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 19:43:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977730996] [2023-11-21 19:43:32,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:32,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:43:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:43:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=8, NotChecked=122, Total=1122 [2023-11-21 19:43:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:32,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:32,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:32,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:32,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:32,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:33,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-21 19:43:33,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:33,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:33,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1272733395, now seen corresponding path program 2 times [2023-11-21 19:43:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:33,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541656310] [2023-11-21 19:43:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541656310] [2023-11-21 19:43:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541656310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591047576] [2023-11-21 19:43:34,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:43:34,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:34,090 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:34,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 19:43:34,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:43:34,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:43:34,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 19:43:34,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:34,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 19:43:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:34,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 19:43:34,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:34,521 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:43:34,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:34,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:43:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:34,682 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 43 treesize of output 32 [2023-11-21 19:43:34,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:34,696 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 43 treesize of output 32 [2023-11-21 19:43:34,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:34,712 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 43 treesize of output 32 [2023-11-21 19:43:34,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:34,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:34,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:34,799 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 43 treesize of output 32 [2023-11-21 19:43:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:34,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:34,887 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false [2023-11-21 19:43:34,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:43:34,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1331) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2023-11-21 19:43:35,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 19:43:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 19:43:35,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591047576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:35,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:35,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-21 19:43:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386344308] [2023-11-21 19:43:35,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:35,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 19:43:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 19:43:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1053, Unknown=9, NotChecked=204, Total=1406 [2023-11-21 19:43:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:35,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:35,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:35,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:35,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:35,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:35,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:36,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-21 19:43:36,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 19:43:36,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:36,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1286145172, now seen corresponding path program 1 times [2023-11-21 19:43:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546220172] [2023-11-21 19:43:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-21 19:43:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546220172] [2023-11-21 19:43:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546220172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:36,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:43:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363965437] [2023-11-21 19:43:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:36,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:36,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:36,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 19:43:36,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:36,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1277034093, now seen corresponding path program 1 times [2023-11-21 19:43:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761385611] [2023-11-21 19:43:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-21 19:43:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:37,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761385611] [2023-11-21 19:43:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761385611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:37,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:37,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:43:37,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419125536] [2023-11-21 19:43:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:37,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:37,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:37,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:37,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:37,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:37,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 19:43:37,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:37,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1583334273, now seen corresponding path program 1 times [2023-11-21 19:43:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:37,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817697806] [2023-11-21 19:43:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:38,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817697806] [2023-11-21 19:43:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817697806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836620299] [2023-11-21 19:43:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:38,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:38,820 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:38,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 19:43:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:38,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-21 19:43:38,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:39,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:39,357 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 21 treesize of output 20 [2023-11-21 19:43:39,403 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 32 [2023-11-21 19:43:39,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:43:39,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 19:43:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-21 19:43:39,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,816 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 43 treesize of output 32 [2023-11-21 19:43:39,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,835 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 43 treesize of output 32 [2023-11-21 19:43:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,854 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 43 treesize of output 32 [2023-11-21 19:43:39,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,897 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 43 treesize of output 32 [2023-11-21 19:43:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,964 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 43 treesize of output 32 [2023-11-21 19:43:39,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,981 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 43 treesize of output 32 [2023-11-21 19:43:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:39,999 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 43 treesize of output 32 [2023-11-21 19:43:40,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,015 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 43 treesize of output 32 [2023-11-21 19:43:40,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,187 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 43 treesize of output 32 [2023-11-21 19:43:40,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:40,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,245 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 43 treesize of output 32 [2023-11-21 19:43:40,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,262 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 43 treesize of output 32 [2023-11-21 19:43:40,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,341 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 43 treesize of output 32 [2023-11-21 19:43:40,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,352 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 43 treesize of output 32 [2023-11-21 19:43:40,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,364 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 43 treesize of output 32 [2023-11-21 19:43:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:40,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:40,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:40,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:43:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:40,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:41,138 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:43:41,295 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:43:41,592 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:43:41,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 .cse2 (store (select .cse3 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:43:42,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse0 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 .cse2 (store (select .cse3 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))))) is different from false [2023-11-21 19:43:42,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse3 .cse2 (store (select .cse3 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:43:42,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4)))))) is different from false [2023-11-21 19:43:42,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse8))))))) is different from false [2023-11-21 19:43:42,264 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1718 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1717 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1717))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1718))) c_threadThread1of2ForFork0_~p~0.base) .cse9) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0)))))) is different from false [2023-11-21 19:43:42,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:42,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 19:43:42,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:42,311 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 8944 treesize of output 8056 [2023-11-21 19:43:42,346 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 770 treesize of output 738 [2023-11-21 19:43:42,358 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 864 treesize of output 800 [2023-11-21 19:43:42,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 68 [2023-11-21 19:43:42,861 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:43:42,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-21 19:43:42,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:42,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 19:43:42,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:42,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:42,884 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:43:42,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 244 [2023-11-21 19:43:42,892 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 83 treesize of output 79 [2023-11-21 19:43:42,897 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 194 treesize of output 160 [2023-11-21 19:43:42,904 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 164 treesize of output 156 [2023-11-21 19:43:42,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:42,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 19:43:42,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:42,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:42,947 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:43:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 264 [2023-11-21 19:43:42,955 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 180 treesize of output 172 [2023-11-21 19:43:42,960 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 223 treesize of output 169 [2023-11-21 19:43:42,968 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 86 treesize of output 82 [2023-11-21 19:43:43,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 19:43:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:43:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836620299] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:43,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2023-11-21 19:43:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562322220] [2023-11-21 19:43:43,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:43,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-21 19:43:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-21 19:43:43,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2321, Unknown=9, NotChecked=954, Total=3540 [2023-11-21 19:43:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:43,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:43,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 4.745762711864407) internal successors, (280), 60 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:43,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:43:49,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-21 19:43:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:49,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:49,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -544250973, now seen corresponding path program 1 times [2023-11-21 19:43:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357805606] [2023-11-21 19:43:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357805606] [2023-11-21 19:43:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357805606] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196562123] [2023-11-21 19:43:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:50,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:50,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 19:43:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:50,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 19:43:50,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:50,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:50,699 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:43:50,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:43:50,770 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:50,770 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 23 treesize of output 23 [2023-11-21 19:43:50,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:51,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:51,036 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 21 treesize of output 20 [2023-11-21 19:43:51,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:51,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:43:51,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:51,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:43:51,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:43:51,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:51,666 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 43 treesize of output 32 [2023-11-21 19:43:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:51,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:51,684 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1892 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1892 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1892 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1892 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:51,703 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:43:51,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:43:51,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse0 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:43:51,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:43:51,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse3)))))) is different from false [2023-11-21 19:43:52,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1891) .cse1 v_ArrVal_1892) c_threadThread1of2ForFork0_~p~0.base) .cse4)))))) is different from false [2023-11-21 19:43:52,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:52,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2023-11-21 19:43:52,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:52,028 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 1580 treesize of output 1114 [2023-11-21 19:43:52,042 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 55 treesize of output 47 [2023-11-21 19:43:52,045 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 47 treesize of output 43 [2023-11-21 19:43:52,049 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 66 treesize of output 50 [2023-11-21 19:43:52,070 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:43:52,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2023-11-21 19:43:52,074 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:43:52,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2023-11-21 19:43:52,079 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:43:52,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 19:43:52,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:43:52,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2023-11-21 19:43:52,360 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:52,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:43:52,363 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 10 treesize of output 8 [2023-11-21 19:43:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:43:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196562123] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:43:52,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:43:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2023-11-21 19:43:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975933734] [2023-11-21 19:43:52,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:43:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-21 19:43:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-21 19:43:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1335, Unknown=7, NotChecked=560, Total=2070 [2023-11-21 19:43:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:52,389 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:52,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.955555555555556) internal successors, (223), 46 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:43:52,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:43:53,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-21 19:43:54,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:54,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:54,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 974478298, now seen corresponding path program 1 times [2023-11-21 19:43:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357445561] [2023-11-21 19:43:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-21 19:43:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357445561] [2023-11-21 19:43:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357445561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:54,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:54,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:43:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775826114] [2023-11-21 19:43:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:54,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:43:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:54,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:43:54,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:43:54,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:43:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:54,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 19:43:54,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:43:54,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -832976165, now seen corresponding path program 1 times [2023-11-21 19:43:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:43:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783331183] [2023-11-21 19:43:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:43:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783331183] [2023-11-21 19:43:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783331183] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:43:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291170856] [2023-11-21 19:43:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:56,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:43:56,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:43:56,094 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:43:56,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-21 19:43:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:56,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-21 19:43:56,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:43:56,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:43:56,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 19:43:56,364 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:43:56,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 19:43:56,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:43:56,949 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 21 treesize of output 20 [2023-11-21 19:43:57,009 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 32 [2023-11-21 19:43:57,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:43:57,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-21 19:43:57,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 19:43:57,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:57,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:58,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 19:43:58,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:58,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:58,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:43:58,157 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 43 treesize of output 32 [2023-11-21 19:43:58,170 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 43 treesize of output 32 [2023-11-21 19:43:58,181 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 43 treesize of output 32 [2023-11-21 19:43:58,193 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 43 treesize of output 32 [2023-11-21 19:43:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:43:58,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:43:58,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:43:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:43:58,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:43:59,178 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:43:59,271 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2186))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:43:59,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:43:59,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))))) is different from false [2023-11-21 19:43:59,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse1 v_ArrVal_2186))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))))) is different from false [2023-11-21 19:43:59,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse3))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse3))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse3))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse2 v_ArrVal_2186))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse3))))) is different from false [2023-11-21 19:44:00,037 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:44:00,069 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse3 v_ArrVal_2186))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:02,189 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 19:44:02,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse8)))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0)))))) is different from false [2023-11-21 19:44:02,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse9 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) .cse9) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2187 Int) (v_ArrVal_2186 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_22 Int) (v_ArrVal_2174 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2182) .cse4 v_ArrVal_2186))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2187))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:44:02,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:02,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 90 [2023-11-21 19:44:02,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:02,327 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 54956 treesize of output 48284 [2023-11-21 19:44:02,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3982 treesize of output 3726 [2023-11-21 19:44:02,493 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 4012 treesize of output 3884 [2023-11-21 19:44:02,537 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 4027 treesize of output 3963 [2023-11-21 19:44:04,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:04,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 110 [2023-11-21 19:44:04,835 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:44:04,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 1 [2023-11-21 19:44:04,841 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:44:04,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 1 [2023-11-21 19:44:04,847 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:44:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 1 [2023-11-21 19:44:05,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:44:05,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-11-21 19:44:05,606 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 19:44:05,606 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 58 treesize of output 54 [2023-11-21 19:44:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:44:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291170856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:05,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 71 [2023-11-21 19:44:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935074117] [2023-11-21 19:44:05,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:05,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-21 19:44:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-21 19:44:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3385, Unknown=11, NotChecked=1408, Total=5112 [2023-11-21 19:44:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:05,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:05,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.9295774647887325) internal successors, (279), 72 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:05,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:18,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:18,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:18,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:18,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1709007321, now seen corresponding path program 2 times [2023-11-21 19:44:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625334286] [2023-11-21 19:44:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625334286] [2023-11-21 19:44:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625334286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992581335] [2023-11-21 19:44:19,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:44:19,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:19,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:19,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-21 19:44:20,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:44:20,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:20,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-21 19:44:20,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:44:20,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:44:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:44:21,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-21 19:44:21,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:44:21,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,061 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 30 treesize of output 21 [2023-11-21 19:44:21,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:44:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:21,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:21,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:44:22,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:22,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:22,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:22,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:22,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:22,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 19:44:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:22,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:22,758 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:44:22,911 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:44:23,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:23,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse3 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 19:44:23,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))))) is different from false [2023-11-21 19:44:23,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))))) is different from false [2023-11-21 19:44:23,626 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse3))))) is different from false [2023-11-21 19:44:23,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))))) is different from false [2023-11-21 19:44:23,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (= (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:44:23,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse8)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2385 (Array Int Int)) (v_ArrVal_2404 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2385) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2402))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2404))) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:44:23,850 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:44:23,851 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 5062 treesize of output 4488 [2023-11-21 19:44:23,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:23,892 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 1122 treesize of output 1024 [2023-11-21 19:44:23,907 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 460 treesize of output 452 [2023-11-21 19:44:23,919 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 820 treesize of output 788 [2023-11-21 19:44:23,929 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 932 treesize of output 868 [2023-11-21 19:44:24,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,872 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-21 19:44:24,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 770 treesize of output 749 [2023-11-21 19:44:24,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 148 [2023-11-21 19:44:24,886 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 82 treesize of output 78 [2023-11-21 19:44:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:24,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,917 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:44:24,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1266 treesize of output 1 [2023-11-21 19:44:24,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:24,930 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:44:24,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1202 treesize of output 1 [2023-11-21 19:44:25,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 19:44:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:44:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:44:25,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992581335] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:25,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:25,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2023-11-21 19:44:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757191650] [2023-11-21 19:44:25,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:25,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-21 19:44:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-21 19:44:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2700, Unknown=10, NotChecked=1150, Total=4160 [2023-11-21 19:44:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:25,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:25,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.4375) internal successors, (284), 65 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:25,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:25,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-21 19:44:31,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:31,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 19:44:31,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:31,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2080571779, now seen corresponding path program 2 times [2023-11-21 19:44:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98225529] [2023-11-21 19:44:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:33,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98225529] [2023-11-21 19:44:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98225529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625125303] [2023-11-21 19:44:33,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:44:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:33,057 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:33,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-21 19:44:33,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:44:33,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:33,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-21 19:44:33,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:33,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:44:33,348 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:44:33,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:44:33,392 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:44:33,392 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 23 treesize of output 23 [2023-11-21 19:44:33,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:44:33,891 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 21 treesize of output 20 [2023-11-21 19:44:33,955 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 32 [2023-11-21 19:44:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-21 19:44:34,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 19:44:34,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,345 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 34 treesize of output 25 [2023-11-21 19:44:34,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:44:34,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,440 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 43 treesize of output 32 [2023-11-21 19:44:34,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,463 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 43 treesize of output 32 [2023-11-21 19:44:34,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,510 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 43 treesize of output 32 [2023-11-21 19:44:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,642 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 43 treesize of output 32 [2023-11-21 19:44:34,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,668 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 43 treesize of output 32 [2023-11-21 19:44:34,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,685 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 43 treesize of output 32 [2023-11-21 19:44:34,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:34,704 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 43 treesize of output 32 [2023-11-21 19:44:34,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:44:35,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:44:35,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:44:35,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:44:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 19:44:35,136 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 43 treesize of output 32 [2023-11-21 19:44:35,156 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 43 treesize of output 32 [2023-11-21 19:44:35,169 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 43 treesize of output 32 [2023-11-21 19:44:35,191 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 43 treesize of output 32 [2023-11-21 19:44:35,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:35,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:35,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:44:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:35,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:36,350 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:44:36,483 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2608))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-21 19:44:36,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:44:36,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse1 v_ArrVal_2608))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:44:37,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse2 v_ArrVal_2608))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse2 v_ArrVal_2608))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse2 v_ArrVal_2608))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse2 v_ArrVal_2608))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:44:37,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse7 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:44:37,184 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:44:37,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse4 v_ArrVal_2608))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse4 v_ArrVal_2608))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse4 v_ArrVal_2608))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse4 v_ArrVal_2608))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:44:37,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))))) is different from false [2023-11-21 19:44:37,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse3 v_ArrVal_2608))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))))) is different from false [2023-11-21 19:44:37,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0)))))) is different from false [2023-11-21 19:44:37,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse9 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) .cse9)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2609 Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse10 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2591) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2604) .cse5 v_ArrVal_2608))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2609))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:44:37,672 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:44:37,674 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 765502 treesize of output 704112 [2023-11-21 19:44:37,897 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 4374 treesize of output 4118 [2023-11-21 19:44:37,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:37,935 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 4606 treesize of output 4188 [2023-11-21 19:44:38,006 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 3846 treesize of output 3782 [2023-11-21 19:44:38,042 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 2418 treesize of output 2402 [2023-11-21 19:44:38,126 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 4090 treesize of output 3962 [2023-11-21 19:44:43,613 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,631 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 19:44:43,632 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2610 treesize of output 2009 [2023-11-21 19:44:43,647 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 325 [2023-11-21 19:44:43,657 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 162 treesize of output 158 [2023-11-21 19:44:43,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:43,677 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 290 treesize of output 274 [2023-11-21 19:44:43,709 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,728 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-21 19:44:43,728 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1618 treesize of output 1597 [2023-11-21 19:44:43,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 308 [2023-11-21 19:44:43,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:43,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158 [2023-11-21 19:44:43,760 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 351 treesize of output 335 [2023-11-21 19:44:43,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:43,807 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:44:43,808 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2482 treesize of output 1 [2023-11-21 19:44:44,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:44:44,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2023-11-21 19:44:44,492 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:44,493 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 10 treesize of output 8 [2023-11-21 19:44:44,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:44:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625125303] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:44,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 70 [2023-11-21 19:44:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815656466] [2023-11-21 19:44:44,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-21 19:44:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-21 19:44:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3182, Unknown=12, NotChecked=1500, Total=4970 [2023-11-21 19:44:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:44,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.942857142857143) internal successors, (276), 71 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-11-21 19:44:44,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-21 19:44:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:44:55,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-21 19:44:55,589 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:55,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1069834908, now seen corresponding path program 2 times [2023-11-21 19:44:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056255813] [2023-11-21 19:44:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 19:44:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:55,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056255813] [2023-11-21 19:44:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056255813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:55,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074351908] [2023-11-21 19:44:55,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:44:55,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:55,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:55,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:55,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-21 19:44:56,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:44:56,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:56,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 19:44:56,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:56,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 19:44:56,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:44:56,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:56,375 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-21 19:44:56,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:44:56,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:44:56,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:56,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:44:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 19:44:56,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:56,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2777 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2777) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) is different from false [2023-11-21 19:44:56,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:56,487 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 18 treesize of output 19 [2023-11-21 19:44:56,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-21 19:44:56,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 19:44:56,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:44:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 19:44:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074351908] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:56,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2023-11-21 19:44:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548559557] [2023-11-21 19:44:56,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:56,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-21 19:44:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-21 19:44:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=884, Unknown=1, NotChecked=60, Total=1056 [2023-11-21 19:44:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:56,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:56,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:44:56,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:56,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:56,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:44:56,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:44:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-21 19:44:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:44:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:44:57,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:57,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-21 19:44:57,951 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -178655567, now seen corresponding path program 3 times [2023-11-21 19:44:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061814790] [2023-11-21 19:44:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061814790] [2023-11-21 19:44:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061814790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586601115] [2023-11-21 19:44:59,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:44:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:59,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:59,281 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:59,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-21 19:44:59,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 19:44:59,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:59,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-21 19:44:59,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:00,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:45:00,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:45:00,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:45:00,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:45:00,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-21 19:45:00,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:00,811 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 30 treesize of output 21 [2023-11-21 19:45:00,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:00,835 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 30 treesize of output 21 [2023-11-21 19:45:00,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:00,857 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 30 treesize of output 21 [2023-11-21 19:45:00,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:00,883 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 30 treesize of output 21 [2023-11-21 19:45:00,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:00,999 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 30 treesize of output 21 [2023-11-21 19:45:01,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,030 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 30 treesize of output 21 [2023-11-21 19:45:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,057 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 30 treesize of output 21 [2023-11-21 19:45:01,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,079 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 30 treesize of output 21 [2023-11-21 19:45:01,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,363 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 30 treesize of output 21 [2023-11-21 19:45:01,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:45:01,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:01,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:01,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:01,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,644 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:45:01,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-21 19:45:01,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:01,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:45:02,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:02,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:02,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:02,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:02,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-11-21 19:45:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:02,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:04,909 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_2997 (Array Int Int))) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-21 19:45:05,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (not (= (select v_ArrVal_2993 .cse1) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (not (= (select v_ArrVal_2993 .cse1) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (not (= (select v_ArrVal_2993 .cse1) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (not (= (select v_ArrVal_2993 .cse1) 0)))))) is different from false [2023-11-21 19:45:05,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) (not (= (select v_ArrVal_2993 .cse2) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (not (= (select v_ArrVal_2993 .cse2) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (not (= (select v_ArrVal_2993 .cse2) 0)))) (forall ((v_ArrVal_2993 (Array Int Int))) (or (forall ((v_ArrVal_2997 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse6 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (not (= (select v_ArrVal_2993 .cse2) 0))))))) is different from false [2023-11-21 19:45:07,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse3) 0)))))) is different from false [2023-11-21 19:45:07,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse3) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2993 .cse3) 0)))))) is different from false [2023-11-21 19:45:08,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))))) is different from false [2023-11-21 19:45:08,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select v_ArrVal_2993 .cse4) 0)))))) is different from false [2023-11-21 19:45:08,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse3) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse3) (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse3) (not (= (select v_ArrVal_2993 .cse4) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse3) (not (= (select v_ArrVal_2993 .cse4) 0)))))) is different from false [2023-11-21 19:45:08,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse6 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (= (select (select (let ((.cse8 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse9 .cse1 (store (select .cse9 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0))))))) is different from false [2023-11-21 19:45:08,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse10 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse6 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (not (= (select v_ArrVal_2993 .cse6) 0)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2993 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_30 Int) (v_ArrVal_2999 Int)) (or (not (= (select v_ArrVal_2997 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~p~0.offset_30 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2988) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2993) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2997))) (store .cse9 .cse1 (store (select .cse9 .cse1) v_threadThread2of2ForFork0_~p~0.offset_30 v_ArrVal_2999))) c_threadThread1of2ForFork0_~p~0.base) .cse10)) (not (= (select v_ArrVal_2993 .cse6) 0))))))) is different from false [2023-11-21 19:45:08,576 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:45:08,576 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 14862 treesize of output 12992 [2023-11-21 19:45:08,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:08,632 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 2642 treesize of output 2368 [2023-11-21 19:45:08,655 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 428 treesize of output 424 [2023-11-21 19:45:08,669 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 442 treesize of output 434 [2023-11-21 19:45:08,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:08,690 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 967 treesize of output 911 [2023-11-21 19:45:08,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:08,725 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 977 treesize of output 951 [2023-11-21 19:45:10,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,958 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,974 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:10,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,015 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:45:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5078 treesize of output 1 [2023-11-21 19:45:11,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,039 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 19:45:11,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3158 treesize of output 2989 [2023-11-21 19:45:11,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,051 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 204 treesize of output 184 [2023-11-21 19:45:11,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:11,066 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 195 treesize of output 195 [2023-11-21 19:45:11,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:11,079 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 111 treesize of output 113 [2023-11-21 19:45:11,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:11,141 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:45:11,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5334 treesize of output 1 [2023-11-21 19:45:11,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 19:45:11,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:45:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2023-11-21 19:45:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586601115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:11,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 26] total 70 [2023-11-21 19:45:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968595324] [2023-11-21 19:45:11,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-21 19:45:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-21 19:45:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3344, Unknown=23, NotChecked=1270, Total=4970 [2023-11-21 19:45:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:11,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:11,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.128571428571429) internal successors, (289), 71 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:45:11,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:45:11,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:45:28,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:28,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:28,884 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:28,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1509322023, now seen corresponding path program 1 times [2023-11-21 19:45:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264231867] [2023-11-21 19:45:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264231867] [2023-11-21 19:45:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264231867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190313904] [2023-11-21 19:45:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:29,367 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:29,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-21 19:45:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:29,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-21 19:45:29,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-21 19:45:29,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:45:29,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,922 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-21 19:45:29,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 19:45:29,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:29,967 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:45:30,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:45:30,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:30,140 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 43 treesize of output 32 [2023-11-21 19:45:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:30,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:30,179 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3177 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~p~0.base v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3177 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread2of2ForFork0_~p~0.base v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (forall ((v_ArrVal_3177 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~p~0.base v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3177 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~p~0.base v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false [2023-11-21 19:45:30,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32) (= (select (select (store .cse0 v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int))) (or (= (select (select (store .cse0 v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int))) (or (= (select (select (store .cse0 v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int))) (or (= (select (select (store .cse0 v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32)))))) is different from false [2023-11-21 19:45:32,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (and (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3170 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_3170))) (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0) .cse3 0))) v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3170 (Array Int Int))) (or (= 0 (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_3170))) (store .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0) .cse3 0))) v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2)) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3170 (Array Int Int))) (or (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_3170))) (store .cse5 |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0) .cse3 0))) v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0) (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32))) (forall ((v_threadThread2of2ForFork0_~p~0.base_32 Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3170 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.base| v_threadThread2of2ForFork0_~p~0.base_32) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_3170))) (store .cse6 |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select .cse6 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0) .cse3 0))) v_threadThread2of2ForFork0_~p~0.base_32 v_ArrVal_3177) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3) 0))))) is different from false [2023-11-21 19:45:32,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:45:32,668 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:32,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:32,671 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 18 treesize of output 19 [2023-11-21 19:45:32,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-21 19:45:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 19:45:32,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:32,678 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:32,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:32,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:32,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:45:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-21 19:45:33,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190313904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:33,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:33,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 50 [2023-11-21 19:45:33,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523206078] [2023-11-21 19:45:33,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:33,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 19:45:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:33,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 19:45:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1962, Unknown=35, NotChecked=276, Total=2450 [2023-11-21 19:45:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:33,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:33,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.0) internal successors, (250), 50 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:33,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:33,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:33,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:33,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:45:33,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:45:33,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:33,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:45:33,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:45:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:45:35,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:35,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-21 19:45:35,444 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:35,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash 762138172, now seen corresponding path program 1 times [2023-11-21 19:45:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825787557] [2023-11-21 19:45:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825787557] [2023-11-21 19:45:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825787557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085564918] [2023-11-21 19:45:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:37,044 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:37,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-21 19:45:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:37,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-21 19:45:37,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:37,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:45:37,700 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 21 treesize of output 20 [2023-11-21 19:45:37,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 19:45:38,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 19:45:38,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-21 19:45:38,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,084 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 34 treesize of output 25 [2023-11-21 19:45:38,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,105 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 34 treesize of output 25 [2023-11-21 19:45:38,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,123 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 34 treesize of output 25 [2023-11-21 19:45:38,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,139 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 34 treesize of output 25 [2023-11-21 19:45:38,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,212 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 34 treesize of output 25 [2023-11-21 19:45:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,227 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 34 treesize of output 25 [2023-11-21 19:45:38,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,246 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 34 treesize of output 25 [2023-11-21 19:45:38,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,256 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 34 treesize of output 25 [2023-11-21 19:45:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,475 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 34 treesize of output 25 [2023-11-21 19:45:38,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 19:45:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,561 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 43 treesize of output 32 [2023-11-21 19:45:38,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,578 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 43 treesize of output 32 [2023-11-21 19:45:38,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,600 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 43 treesize of output 32 [2023-11-21 19:45:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:45:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,853 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 43 treesize of output 32 [2023-11-21 19:45:38,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,868 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 43 treesize of output 32 [2023-11-21 19:45:38,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,879 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 43 treesize of output 32 [2023-11-21 19:45:38,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,892 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 43 treesize of output 32 [2023-11-21 19:45:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:38,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:38,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2023-11-21 19:45:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:38,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:39,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread2of2ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397))) (store .cse0 c_threadThread2of2ForFork0_~p~0.base (store (select .cse0 c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397))) (store .cse2 c_threadThread2of2ForFork0_~p~0.base (store (select .cse2 c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397))) (store .cse3 c_threadThread2of2ForFork0_~p~0.base (store (select .cse3 c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397))) (store .cse4 c_threadThread2of2ForFork0_~p~0.base (store (select .cse4 c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:45:39,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_threadThread2of2ForFork0_~p~0.base)) (.cse1 (+ c_threadThread2of2ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~p~0.base (store .cse0 c_threadThread2of2ForFork0_~p~0.offset v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~p~0.base (store .cse0 c_threadThread2of2ForFork0_~p~0.offset v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~p~0.base (store .cse0 c_threadThread2of2ForFork0_~p~0.offset v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~p~0.base (store .cse0 c_threadThread2of2ForFork0_~p~0.offset v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~p~0.base) .cse1 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:45:39,287 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_threadThread2of2ForFork0_~arg.base))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_34 Int)) (or (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~arg.base (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (< v_threadThread2of2ForFork0_~p~0.offset_34 c_threadThread2of2ForFork0_~arg.offset))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_34 Int)) (or (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~arg.base (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (< v_threadThread2of2ForFork0_~p~0.offset_34 c_threadThread2of2ForFork0_~arg.offset))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_34 Int)) (or (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~arg.base (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (< v_threadThread2of2ForFork0_~p~0.offset_34 c_threadThread2of2ForFork0_~arg.offset))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_34 Int)) (or (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3393 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base (store (select (store (store |c_#race| c_threadThread2of2ForFork0_~arg.base (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) c_threadThread2of2ForFork0_~arg.base) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_34 c_threadThread2of2ForFork0_~arg.offset))))) is different from false [2023-11-21 19:45:39,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_threadThread2of2ForFork0_#in~arg.base|))) (and (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:45:39,355 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:45:39,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 19:45:39,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base| (store (select (store (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_threadThread2of2ForFork0_#in~arg.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:45:39,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse2))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse2))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse2))) (forall ((v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse2))))) is different from false [2023-11-21 19:45:39,848 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse3 (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse3) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse2 c_threadThread1of2ForFork0_~p~0.base .cse3) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse7 (store (select (store .cse6 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse7) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse6 c_threadThread1of2ForFork0_~p~0.base .cse7) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse10 (store (select (store .cse9 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse8 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse8 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse9 c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse13 (store (select (store .cse12 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse11 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse13) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse11 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select (store (store .cse12 c_threadThread1of2ForFork0_~p~0.base .cse13) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_main_#t~mem9#1.base|) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))))) is different from false [2023-11-21 19:45:40,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse3 (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse3) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse0 .cse1 (store (select (store (store .cse2 c_threadThread1of2ForFork0_~p~0.base .cse3) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse8 (store (select (store .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse6 .cse1 (store (select (store (store .cse7 c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse11 (store (select (store .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse9 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse9 .cse1 (store (select (store (store .cse10 c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse14 (store (select (store .cse13 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse12 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse12 .cse1 (store (select (store (store .cse13 c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 19:45:40,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse4) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse1 .cse2 (store (select (store (store .cse3 c_threadThread1of2ForFork0_~p~0.base .cse4) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse8 (store (select (store .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse6 .cse2 (store (select (store (store .cse7 c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse11 (store (select (store .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse9 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse9 .cse2 (store (select (store (store .cse10 c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse14 (store (select (store .cse13 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse12 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse12 .cse2 (store (select (store (store .cse13 c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))))) is different from false [2023-11-21 19:45:40,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse4) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse1 .cse2 (store (select (store (store .cse3 c_threadThread1of2ForFork0_~p~0.base .cse4) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse8 (store (select (store .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse6 .cse2 (store (select (store (store .cse7 c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse11 (store (select (store .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse9 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse9 .cse2 (store (select (store (store .cse10 c_threadThread1of2ForFork0_~p~0.base .cse11) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= (select (select (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385))) (let ((.cse14 (store (select (store .cse13 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse12 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2 (store (select (store (store .cse12 .cse2 (store (select (store (store .cse13 c_threadThread1of2ForFork0_~p~0.base .cse14) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse2) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse2) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|))))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse0))))) is different from false [2023-11-21 19:45:40,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse2) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse0 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse2) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse6))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse7 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse8) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse6))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse9 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse9 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse6))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse11 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse12) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse11 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse12) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse6)))))) is different from false [2023-11-21 19:45:40,441 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse13 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse2) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse0 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse2) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse7) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse6 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse7) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) .cse8)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse9 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse9 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse10) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5))) (forall ((v_ArrVal_3385 (Array Int Int)) (v_ArrVal_3386 (Array Int Int)) (v_ArrVal_3397 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_34 Int) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3393 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3386) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (let ((.cse11 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base .cse12) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391))) (store (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1 (store (select (store (store .cse11 .cse1 (store (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3385) c_threadThread1of2ForFork0_~p~0.base .cse12) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3391) .cse1) v_threadThread2of2ForFork0_~p~0.offset_34 v_ArrVal_3393)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3397) .cse1) (+ v_threadThread2of2ForFork0_~p~0.offset_34 1) |threadThread2of2ForFork0_#t~nondet4|)))) c_threadThread1of2ForFork0_~p~0.base) .cse13)) (< v_threadThread2of2ForFork0_~p~0.offset_34 .cse5)))))) is different from false [2023-11-21 19:45:40,480 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:45:40,481 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 10482 treesize of output 9152 [2023-11-21 19:45:40,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:40,504 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 1143 treesize of output 1037 [2023-11-21 19:45:40,519 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 994 treesize of output 976 [2023-11-21 19:45:40,543 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 384 treesize of output 380 [2023-11-21 19:45:40,561 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 345 treesize of output 343 [2023-11-21 19:45:40,573 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 725 treesize of output 713 [2023-11-21 19:45:41,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,031 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,067 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 19:45:41,067 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1357 treesize of output 1212 [2023-11-21 19:45:41,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 128 [2023-11-21 19:45:41,081 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 217 treesize of output 209 [2023-11-21 19:45:41,094 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 32 treesize of output 28 [2023-11-21 19:45:41,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,131 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:45:41,132 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1391 treesize of output 1 [2023-11-21 19:45:41,134 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,134 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:41,142 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:45:41,143 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1391 treesize of output 1 [2023-11-21 19:45:41,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 19:45:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:45:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085564918] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:41,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:41,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 65 [2023-11-21 19:45:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88174737] [2023-11-21 19:45:41,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:41,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-21 19:45:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-21 19:45:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2448, Unknown=14, NotChecked=1582, Total=4290 [2023-11-21 19:45:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:41,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:41,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 4.415384615384616) internal successors, (287), 66 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:45:41,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:45:41,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:45:41,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:41,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:45:41,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:45:41,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:45:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:45:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:45:50,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-21 19:45:50,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:50,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 795650249, now seen corresponding path program 4 times [2023-11-21 19:45:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477157367] [2023-11-21 19:45:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:51,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:51,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477157367] [2023-11-21 19:45:51,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477157367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:51,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138187198] [2023-11-21 19:45:51,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:45:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:51,732 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-21 19:45:52,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:45:52,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:45:52,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:45:52,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:52,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:45:52,677 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 21 treesize of output 20 [2023-11-21 19:45:52,728 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 32 [2023-11-21 19:45:52,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-21 19:45:52,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-21 19:45:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,046 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 34 treesize of output 25 [2023-11-21 19:45:53,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,059 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 34 treesize of output 25 [2023-11-21 19:45:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,080 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 34 treesize of output 25 [2023-11-21 19:45:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,098 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 34 treesize of output 25 [2023-11-21 19:45:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,167 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 34 treesize of output 25 [2023-11-21 19:45:53,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,184 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 34 treesize of output 25 [2023-11-21 19:45:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,201 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 34 treesize of output 25 [2023-11-21 19:45:53,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,218 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 34 treesize of output 25 [2023-11-21 19:45:53,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,423 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 34 treesize of output 25 [2023-11-21 19:45:53,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,439 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 34 treesize of output 25 [2023-11-21 19:45:53,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,456 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 34 treesize of output 25 [2023-11-21 19:45:53,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,473 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 34 treesize of output 25 [2023-11-21 19:45:53,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,563 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 34 treesize of output 25 [2023-11-21 19:45:53,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,574 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 34 treesize of output 25 [2023-11-21 19:45:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,592 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 34 treesize of output 25 [2023-11-21 19:45:53,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,602 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 34 treesize of output 25 [2023-11-21 19:45:53,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:53,720 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 41 treesize of output 35 [2023-11-21 19:45:53,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:53,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-21 19:45:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:53,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:54,190 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:45:54,284 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:45:54,437 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse1))))) is different from false [2023-11-21 19:45:54,628 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))))) is different from false [2023-11-21 19:45:54,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))))) is different from false [2023-11-21 19:45:54,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse2))))) is different from false [2023-11-21 19:45:54,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_36 Int) (v_ArrVal_3612 Int) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3606 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3606) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3610))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_36 v_ArrVal_3612))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_36 .cse0)))))) is different from false [2023-11-21 19:46:01,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:01,454 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 3 case distinctions, treesize of input 73 treesize of output 66 [2023-11-21 19:46:01,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:01,466 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 9244 treesize of output 8144 [2023-11-21 19:46:01,491 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 878 treesize of output 814 [2023-11-21 19:46:01,502 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 886 treesize of output 854 [2023-11-21 19:46:01,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:01,952 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 90 treesize of output 64 [2023-11-21 19:46:01,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:01,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2023-11-21 19:46:01,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:01,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:01,994 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:01,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 526 treesize of output 462 [2023-11-21 19:46:02,003 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 98 treesize of output 90 [2023-11-21 19:46:02,009 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 84 treesize of output 80 [2023-11-21 19:46:02,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 174 [2023-11-21 19:46:02,043 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:46:02,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1 [2023-11-21 19:46:02,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 19:46:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:46:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138187198] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:02,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:02,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 57 [2023-11-21 19:46:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470325249] [2023-11-21 19:46:02,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:02,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-21 19:46:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-21 19:46:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2285, Unknown=49, NotChecked=728, Total=3306 [2023-11-21 19:46:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:02,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:02,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 4.87719298245614) internal successors, (278), 58 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:46:02,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:46:02,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-11-21 19:46:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:46:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:46:19,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:19,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:19,365 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:19,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash -277659603, now seen corresponding path program 2 times [2023-11-21 19:46:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:19,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134162178] [2023-11-21 19:46:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134162178] [2023-11-21 19:46:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134162178] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892450719] [2023-11-21 19:46:20,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:20,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:20,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:20,147 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-21 19:46:20,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:20,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:20,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-21 19:46:20,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:20,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:46:20,540 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:46:20,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:46:20,586 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:46:20,586 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 23 treesize of output 23 [2023-11-21 19:46:20,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:46:20,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:46:21,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:21,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:46:21,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:21,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:46:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:21,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:21,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:21,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:21,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:21,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:22,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:22,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse0))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:46:22,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse1 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse1 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse1 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse1 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:22,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776))) (store .cse0 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776))) (store .cse3 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776))) (store .cse4 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776))) (store .cse5 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse1))))) is different from false [2023-11-21 19:46:22,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_3781 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3776) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3781) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3786) .cse2 v_ArrVal_3787) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:22,747 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 58 treesize of output 50 [2023-11-21 19:46:22,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-21 19:46:22,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:22,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2023-11-21 19:46:22,761 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:22,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 28 [2023-11-21 19:46:22,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,769 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:46:22,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 1 [2023-11-21 19:46:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:22,773 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:46:22,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2023-11-21 19:46:22,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:46:22,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:46:22,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2023-11-21 19:46:23,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:23,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:23,035 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 10 treesize of output 8 [2023-11-21 19:46:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:46:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892450719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:23,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 50 [2023-11-21 19:46:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319457477] [2023-11-21 19:46:23,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-21 19:46:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-21 19:46:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1824, Unknown=76, NotChecked=460, Total=2550 [2023-11-21 19:46:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:23,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:23,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 4.54) internal successors, (227), 51 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:46:23,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:23,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:23,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:23,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:23,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2023-11-21 19:46:23,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:23,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:23,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:46:23,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-11-21 19:46:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:46:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:46:27,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:27,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-21 19:46:27,883 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:27,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -763915247, now seen corresponding path program 3 times [2023-11-21 19:46:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730524833] [2023-11-21 19:46:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:27,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730524833] [2023-11-21 19:46:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730524833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611488598] [2023-11-21 19:46:29,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:46:29,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:29,445 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:29,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-21 19:46:29,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 19:46:29,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:29,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-21 19:46:29,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:29,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:46:30,062 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:46:30,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:46:30,113 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:46:30,113 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 23 treesize of output 23 [2023-11-21 19:46:30,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:31,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:46:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:31,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-21 19:46:31,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:46:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,606 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 30 treesize of output 21 [2023-11-21 19:46:31,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,629 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 30 treesize of output 21 [2023-11-21 19:46:31,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,660 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 30 treesize of output 21 [2023-11-21 19:46:31,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,691 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 30 treesize of output 21 [2023-11-21 19:46:31,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,901 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 30 treesize of output 21 [2023-11-21 19:46:31,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,926 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 30 treesize of output 21 [2023-11-21 19:46:31,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,953 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 30 treesize of output 21 [2023-11-21 19:46:31,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:31,980 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 30 treesize of output 21 [2023-11-21 19:46:32,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:46:32,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:46:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:32,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:32,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 19:46:32,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:32,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:32,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 19:46:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:32,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:33,604 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:46:33,713 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:46:33,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|)))))) is different from false [2023-11-21 19:46:33,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3992))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:46:33,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_39 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:46:34,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse3))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse3))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse3))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse2 v_ArrVal_3992))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse3))))) is different from false [2023-11-21 19:46:34,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse1 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse3 v_ArrVal_3992))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse4))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse6 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse3 v_ArrVal_3992))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse4))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse8 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse3 v_ArrVal_3992))) (store .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse4))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse10 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse3 v_ArrVal_3992))) (store .cse9 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse4))))) is different from false [2023-11-21 19:46:34,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse3 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse7 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse9 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse11 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))))) is different from false [2023-11-21 19:46:34,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse2 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse4 v_ArrVal_3992))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse5))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse7 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse4 v_ArrVal_3992))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse5))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse9 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse4 v_ArrVal_3992))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse5))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse11 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse4 v_ArrVal_3992))) (store .cse10 .cse1 (store (select .cse10 .cse1) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse5))))) is different from false [2023-11-21 19:46:34,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= (select (select (let ((.cse1 (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse3 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse7 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse9 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977))) (store .cse11 c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:34,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse8)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse4))))))) is different from false [2023-11-21 19:46:36,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse9 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse9)))) (forall ((v_ArrVal_3992 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_39 Int) (v_ArrVal_3983 (Array Int Int)) (v_ArrVal_3993 Int) (v_ArrVal_3977 (Array Int Int)) (v_ArrVal_3988 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_39 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) c_threadThread1of2ForFork0_~p~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_3977) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3983) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3988) .cse5 v_ArrVal_3992))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~p~0.offset_39 v_ArrVal_3993))) c_threadThread1of2ForFork0_~p~0.base) .cse4))))))) is different from false [2023-11-21 19:46:36,849 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:46:36,849 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 105342 treesize of output 100016 [2023-11-21 19:46:36,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:36,921 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 2726 treesize of output 2484 [2023-11-21 19:46:36,995 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 2082 treesize of output 1954 [2023-11-21 19:46:37,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2098 treesize of output 2034 [2023-11-21 19:46:39,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:39,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,149 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,158 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,212 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:46:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 20606 treesize of output 15376 [2023-11-21 19:46:39,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:39,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 822 treesize of output 740 [2023-11-21 19:46:39,250 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 330 treesize of output 326 [2023-11-21 19:46:39,260 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 766 treesize of output 758 [2023-11-21 19:46:39,271 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 768 treesize of output 748 [2023-11-21 19:46:39,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,562 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:46:39,562 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 21694 treesize of output 1 [2023-11-21 19:46:39,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:39,583 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:46:39,584 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 21694 treesize of output 1 [2023-11-21 19:46:40,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-21 19:46:40,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:46:40,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 19:46:40,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2023-11-21 19:46:40,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,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 10 treesize of output 8 [2023-11-21 19:46:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:46:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611488598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:40,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2023-11-21 19:46:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095128783] [2023-11-21 19:46:40,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:40,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-11-21 19:46:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-11-21 19:46:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=4103, Unknown=12, NotChecked=1692, Total=6162 [2023-11-21 19:46:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:40,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:40,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.6666666666666665) internal successors, (286), 79 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:40,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:46:40,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:46:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:46:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-21 19:46:51,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:52,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:52,077 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:52,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1333030111, now seen corresponding path program 4 times [2023-11-21 19:46:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641065363] [2023-11-21 19:46:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641065363] [2023-11-21 19:46:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641065363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175662434] [2023-11-21 19:46:53,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:46:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:53,741 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-21 19:46:54,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:46:54,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:54,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-21 19:46:54,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:54,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:46:54,419 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:46:54,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:46:54,477 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:46:54,477 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 23 treesize of output 23 [2023-11-21 19:46:55,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:55,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:46:55,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:55,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:46:55,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-21 19:46:55,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:55,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:55,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:55,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 19:46:56,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 19:46:56,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 19:46:56,474 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 30 treesize of output 21 [2023-11-21 19:46:56,486 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 30 treesize of output 21 [2023-11-21 19:46:56,500 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 30 treesize of output 21 [2023-11-21 19:46:56,513 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 30 treesize of output 21 [2023-11-21 19:46:56,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:56,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,677 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 37 treesize of output 31 [2023-11-21 19:46:56,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:56,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:57,243 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4197 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:46:57,309 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_4196))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-21 19:46:57,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse1 v_ArrVal_4196))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse1 v_ArrVal_4196))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse1 v_ArrVal_4196))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:46:57,520 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0))))) is different from false [2023-11-21 19:46:57,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:57,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 19:46:57,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0))))) is different from false [2023-11-21 19:46:57,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse2 v_ArrVal_4196))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse3))))) is different from false [2023-11-21 19:46:57,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse4))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse3 v_ArrVal_4196))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 19:46:57,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse4 v_ArrVal_4196))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse4 v_ArrVal_4196))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_4196 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_41 Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4184 (Array Int Int)) (v_ArrVal_4197 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_4184) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4192) .cse4 v_ArrVal_4196))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_41 v_ArrVal_4197))) c_threadThread1of2ForFork0_~p~0.base) .cse8)) (< v_threadThread2of2ForFork0_~p~0.offset_41 .cse0)))))) is different from false [2023-11-21 19:46:57,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:57,967 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 3 case distinctions, treesize of input 85 treesize of output 78 [2023-11-21 19:46:57,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:57,984 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 35720 treesize of output 32688 [2023-11-21 19:46:58,092 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 3694 treesize of output 3566 [2023-11-21 19:46:58,130 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 3677 treesize of output 3645 [2023-11-21 19:46:58,170 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 3867 treesize of output 3803 Killed by 15