./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:01:24,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:01:24,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:01:24,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:01:24,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:01:24,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:01:24,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:01:24,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:01:24,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:01:24,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:01:24,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:01:24,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:01:24,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:01:24,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:01:24,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:01:24,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:01:24,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:01:24,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:01:24,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:01:24,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:01:24,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:01:24,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:01:24,784 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:01:24,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:01:24,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:01:24,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:01:24,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:01:24,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:01:24,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:01:24,786 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:01:24,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:01:24,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:01:24,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:01:24,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:01:24,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:01:24,788 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:01:24,788 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:01:24,788 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:01:24,788 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2023-11-21 22:01:24,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:01:24,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:01:24,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:01:24,987 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:01:24,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:01:24,988 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-init.i [2023-11-21 22:01:25,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:01:26,125 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:01:26,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-21 22:01:26,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6fe2b622e/de8f6370efac4b51ab65cde0b4fa43bc/FLAG8e7c63358 [2023-11-21 22:01:26,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6fe2b622e/de8f6370efac4b51ab65cde0b4fa43bc [2023-11-21 22:01:26,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:01:26,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:01:26,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:01:26,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:01:26,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:01:26,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:26,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c767dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26, skipping insertion in model container [2023-11-21 22:01:26,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:26,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:01:26,683 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:01:26,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:01:26,873 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:01:26,886 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:01:26,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:01:26,973 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:01:26,979 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:01:26,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26 WrapperNode [2023-11-21 22:01:26,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:01:26,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:01:26,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:01:26,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:01:27,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,040 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-21 22:01:27,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:01:27,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:01:27,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:01:27,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:01:27,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:01:27,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:01:27,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:01:27,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:01:27,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (1/1) ... [2023-11-21 22:01:27,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:01:27,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:27,102 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 22:01:27,107 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 22:01:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:01:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:01:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:01:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:01:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:01:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:01:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:01:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:01:27,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:01:27,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:01:27,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:01:27,146 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 22:01:27,288 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:01:27,290 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:01:27,574 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:01:27,586 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:01:27,586 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:01:27,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:27 BoogieIcfgContainer [2023-11-21 22:01:27,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:01:27,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:01:27,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:01:27,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:01:27,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:26" (1/3) ... [2023-11-21 22:01:27,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587ae819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:27, skipping insertion in model container [2023-11-21 22:01:27,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:26" (2/3) ... [2023-11-21 22:01:27,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587ae819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:27, skipping insertion in model container [2023-11-21 22:01:27,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:27" (3/3) ... [2023-11-21 22:01:27,597 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-21 22:01:27,604 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:01:27,612 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:01:27,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 22:01:27,613 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:01:27,676 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:01:27,716 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:01:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:01:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:27,718 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 22:01:27,722 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 22:01:27,773 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:01:27,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:01:27,788 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;@61b8df43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:01:27,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:01:28,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:28,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash 874698824, now seen corresponding path program 1 times [2023-11-21 22:01:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549075258] [2023-11-21 22:01:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:28,253 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 22:01:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549075258] [2023-11-21 22:01:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549075258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:28,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:01:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452349822] [2023-11-21 22:01:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:01:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:28,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:01:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:01:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:28,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:28,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 22:01:28,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:28,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:01:28,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:28,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-21 22:01:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705169766] [2023-11-21 22:01:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:28,904 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 22:01:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705169766] [2023-11-21 22:01:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705169766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:01:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957549090] [2023-11-21 22:01:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:28,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:01:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:01:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:01:28,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:28,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:28,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 22:01:28,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:28,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:29,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:01:29,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:29,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 1 times [2023-11-21 22:01:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699032610] [2023-11-21 22:01:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699032610] [2023-11-21 22:01:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699032610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:01:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121632819] [2023-11-21 22:01:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:31,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:31,089 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 22:01:31,104 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 22:01:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:31,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:01:31,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:01:31,669 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:01:31,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:01:32,079 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:01:32,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:01:32,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:32,090 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 22:01:32,383 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 22:01:32,465 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 22:01:32,553 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 22:01:32,714 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 22:01:33,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 21 treesize of output 13 [2023-11-21 22:01:33,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:33,160 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 51 treesize of output 39 [2023-11-21 22:01:33,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,231 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 22:01:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,265 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 22:01:33,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,284 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 22:01:33,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,300 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 22:01:33,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:33,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:33,388 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 58 treesize of output 47 [2023-11-21 22:01:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:33,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:01:36,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_287 Int) (v_ArrVal_285 (Array Int Int))) (= 0 (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_287 Int) (v_ArrVal_285 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_287 Int) (v_ArrVal_285 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_287 Int) (v_ArrVal_285 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))))) is different from false [2023-11-21 22:01:36,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4)))))) is different from false [2023-11-21 22:01:36,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse8 0))) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1)))))) is different from false [2023-11-21 22:01:36,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse4 0) .cse7 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= 0 (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse7)) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_287 Int) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_285 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_285))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_287))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5)))))) is different from false [2023-11-21 22:01:36,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:36,979 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 81 treesize of output 74 [2023-11-21 22:01:36,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:36,990 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 444 treesize of output 416 [2023-11-21 22:01:37,005 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 190 treesize of output 174 [2023-11-21 22:01:37,031 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 31 treesize of output 17 [2023-11-21 22:01:37,041 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 149 treesize of output 127 [2023-11-21 22:01:37,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-21 22:01:37,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:37,165 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:01:37,165 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 144 treesize of output 130 [2023-11-21 22:01:37,174 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 48 treesize of output 44 [2023-11-21 22:01:37,180 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 80 treesize of output 62 [2023-11-21 22:01:37,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:37,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-21 22:01:37,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:37,217 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:01:37,218 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 144 treesize of output 130 [2023-11-21 22:01:37,225 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 48 treesize of output 44 [2023-11-21 22:01:37,231 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 80 treesize of output 62 [2023-11-21 22:01:37,251 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:01:37,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-21 22:01:37,746 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 65 treesize of output 57 [2023-11-21 22:01:37,750 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 22:01:39,833 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_273 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_273 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|))) is different from false [2023-11-21 22:01:39,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (forall ((v_ArrVal_273 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_273) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (forall ((v_ArrVal_273 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_273) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_14|))))) is different from false [2023-11-21 22:01:40,286 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:01:40,286 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 45 treesize of output 36 [2023-11-21 22:01:40,294 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 11 treesize of output 9 [2023-11-21 22:01:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 22:01:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121632819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:01:40,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:01:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 67 [2023-11-21 22:01:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990601370] [2023-11-21 22:01:40,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:01:40,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-21 22:01:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-21 22:01:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3477, Unknown=81, NotChecked=750, Total=4556 [2023-11-21 22:01:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:40,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:40,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.0597014925373136) internal successors, (205), 68 states have internal predecessors, (205), 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 22:01:40,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:40,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:40,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:01:48,012 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 22:01:48,201 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 22:01:48,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:48,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1685451621, now seen corresponding path program 2 times [2023-11-21 22:01:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558154284] [2023-11-21 22:01:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:49,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:49,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558154284] [2023-11-21 22:01:49,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558154284] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:01:49,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193236627] [2023-11-21 22:01:49,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:01:49,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:49,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:49,882 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 22:01:49,883 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 22:01:50,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:01:50,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:01:50,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:01:50,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:01:50,321 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:01:50,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:01:50,716 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:01:50,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:01:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:50,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 16 treesize of output 11 [2023-11-21 22:01:51,054 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 22:01:51,143 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 22:01:51,219 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 22:01:51,678 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 22:01:51,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:51,686 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 51 treesize of output 39 [2023-11-21 22:01:51,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,770 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 22:01:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,785 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 22:01:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,800 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 22:01:51,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,814 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 22:01:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:51,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:51,913 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 49 treesize of output 35 [2023-11-21 22:01:51,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:51,923 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 22:01:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:51,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:01:52,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-21 22:01:52,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) is different from false [2023-11-21 22:01:54,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))))) is different from false [2023-11-21 22:01:54,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse2) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))))) is different from false [2023-11-21 22:01:54,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4))) (forall ((v_ArrVal_453 Int) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_451))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_453))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse4)))))) is different from false [2023-11-21 22:01:54,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:54,695 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 71 treesize of output 64 [2023-11-21 22:01:54,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:54,704 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 330 treesize of output 318 [2023-11-21 22:01:54,720 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 194 treesize of output 178 [2023-11-21 22:01:54,740 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 23 treesize of output 13 [2023-11-21 22:01:54,750 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 144 treesize of output 126 [2023-11-21 22:01:54,824 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 22:01:54,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 22:01:54,841 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 22:01:54,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1 [2023-11-21 22:01:55,390 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 65 treesize of output 57 [2023-11-21 22:01:55,393 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 22:01:57,491 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_440 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-21 22:01:57,520 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_17| Int)) (or (forall ((v_ArrVal_440 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_17| v_ArrVal_440) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_17| Int)) (or (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_17| v_ArrVal_440) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_17|))))) is different from false [2023-11-21 22:01:57,920 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:01:57,920 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 45 treesize of output 36 [2023-11-21 22:01:57,925 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 11 treesize of output 9 [2023-11-21 22:01:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 22:01:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193236627] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:01:58,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:01:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 66 [2023-11-21 22:01:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772037867] [2023-11-21 22:01:58,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:01:58,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-21 22:01:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-21 22:01:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3296, Unknown=40, NotChecked=854, Total=4422 [2023-11-21 22:01:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:58,066 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:58,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.1363636363636362) internal successors, (207), 67 states have internal predecessors, (207), 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 22:01:58,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:58,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:58,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:01:58,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:04,806 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 22:02:04,995 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 22:02:04,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:04,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1711566779, now seen corresponding path program 3 times [2023-11-21 22:02:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906593545] [2023-11-21 22:02:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906593545] [2023-11-21 22:02:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906593545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699403368] [2023-11-21 22:02:06,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:02:06,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:06,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:06,414 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 22:02:06,415 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 22:02:06,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:02:06,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:06,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:02:06,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:06,775 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:02:07,138 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:07,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:02:07,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,152 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 22:02:07,413 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 22:02:07,491 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 22:02:07,855 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 22:02:07,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:07,865 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 51 treesize of output 39 [2023-11-21 22:02:07,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,933 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 25 treesize of output 18 [2023-11-21 22:02:07,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,946 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 25 treesize of output 18 [2023-11-21 22:02:07,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,957 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 25 treesize of output 18 [2023-11-21 22:02:07,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,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 25 treesize of output 18 [2023-11-21 22:02:08,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,042 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 40 treesize of output 23 [2023-11-21 22:02:08,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,049 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 22:02:08,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,059 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 22:02:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:08,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:08,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-21 22:02:10,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse3))))) is different from false [2023-11-21 22:02:10,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))) is different from false [2023-11-21 22:02:10,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_616))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_618))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5)))))) is different from false [2023-11-21 22:02:10,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:10,441 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 2 case distinctions, treesize of input 61 treesize of output 54 [2023-11-21 22:02:10,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:10,450 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 228 treesize of output 220 [2023-11-21 22:02:10,458 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 197 treesize of output 181 [2023-11-21 22:02:10,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-21 22:02:10,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 122 [2023-11-21 22:02:10,571 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-21 22:02:10,571 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 2 case distinctions, treesize of input 59 treesize of output 1 [2023-11-21 22:02:11,011 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 65 treesize of output 57 [2023-11-21 22:02:11,015 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 22:02:13,094 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_607 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_607 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-21 22:02:13,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_607 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_607) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_607 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_607) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))))) is different from false [2023-11-21 22:02:13,518 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:02:13,518 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 45 treesize of output 36 [2023-11-21 22:02:13,535 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 11 treesize of output 9 [2023-11-21 22:02:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 22:02:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699403368] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:13,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 62 [2023-11-21 22:02:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356544586] [2023-11-21 22:02:13,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:13,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-21 22:02:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-21 22:02:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2969, Unknown=39, NotChecked=690, Total=3906 [2023-11-21 22:02:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:13,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.2580645161290325) internal successors, (202), 63 states have internal predecessors, (202), 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 22:02:13,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:13,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:13,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:13,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:02:20,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-21 22:02:20,447 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 22:02:20,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:20,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 566366343, now seen corresponding path program 4 times [2023-11-21 22:02:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:20,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174631314] [2023-11-21 22:02:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174631314] [2023-11-21 22:02:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174631314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081465125] [2023-11-21 22:02:21,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:02:21,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:21,536 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 22:02:21,537 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 22:02:21,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:02:21,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:21,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-21 22:02:21,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:22,254 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:02:22,255 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 3 case distinctions, treesize of input 69 treesize of output 65 [2023-11-21 22:02:22,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,260 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 24 treesize of output 11 [2023-11-21 22:02:22,751 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:22,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:02:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,760 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 22:02:23,073 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 22:02:23,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:23,415 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 51 treesize of output 39 [2023-11-21 22:02:23,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 7 treesize of output 3 [2023-11-21 22:02:23,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:23,469 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 22:02:23,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:23,490 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 22:02:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:23,508 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 22:02:23,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:23,518 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 22:02:23,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:23,583 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 31 treesize of output 11 [2023-11-21 22:02:23,622 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 22:02:23,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:23,664 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 22:02:23,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:23,711 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 22:02:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:23,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:23,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_783 (Array Int Int))) (or (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_783)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_785))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) is different from false [2023-11-21 22:02:24,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_783 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_783)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_785))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_25| (+ |c_ULTIMATE.start_main_~i~1#1| 1)))) is different from false [2023-11-21 22:02:24,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:24,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2023-11-21 22:02:24,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:24,117 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 286 treesize of output 278 [2023-11-21 22:02:24,124 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 174 treesize of output 166 [2023-11-21 22:02:24,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-21 22:02:24,142 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 115 treesize of output 109 [2023-11-21 22:02:24,744 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_775 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_13| Int) (v_ArrVal_774 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_774))) (or (forall ((v_ArrVal_776 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_13| v_ArrVal_776) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_775))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_13| v_ArrVal_777) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4)))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_13|)))) (forall ((v_ArrVal_774 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-21 22:02:24,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_774 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_775 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_13| Int) (v_ArrVal_774 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774))) (or (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_775))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_13| v_ArrVal_777) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4)))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_13|) (forall ((v_ArrVal_776 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_13| v_ArrVal_776) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-21 22:02:24,840 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 238 treesize of output 218 [2023-11-21 22:02:24,851 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 44 treesize of output 40 [2023-11-21 22:02:24,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-21 22:02:24,864 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 17 treesize of output 15 [2023-11-21 22:02:27,076 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:02:27,077 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 46 treesize of output 33 [2023-11-21 22:02:27,080 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 11 treesize of output 9 [2023-11-21 22:02:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 22:02:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081465125] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:27,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 66 [2023-11-21 22:02:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453397455] [2023-11-21 22:02:27,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:27,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-21 22:02:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-21 22:02:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3600, Unknown=50, NotChecked=500, Total=4422 [2023-11-21 22:02:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:27,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.1363636363636362) internal successors, (207), 67 states have internal predecessors, (207), 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 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:02:27,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:02:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:02:34,056 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 22:02:34,252 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 22:02:34,252 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:34,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 254030409, now seen corresponding path program 5 times [2023-11-21 22:02:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267715199] [2023-11-21 22:02:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:35,259 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 22:02:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267715199] [2023-11-21 22:02:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267715199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246582707] [2023-11-21 22:02:35,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:02:35,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:35,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:35,261 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 22:02:35,261 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 22:02:35,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:35,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:35,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-21 22:02:35,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:36,004 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:02:36,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:36,011 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 22:02:36,578 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:36,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:02:36,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:36,586 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 22:02:37,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:37,117 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 51 treesize of output 35 [2023-11-21 22:02:37,122 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 22:02:37,202 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 22:02:37,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 19 treesize of output 18 [2023-11-21 22:02:37,309 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 22:02:37,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 33 treesize of output 38 [2023-11-21 22:02:37,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:37,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:37,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:37,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:37,433 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 41 [2023-11-21 22:02:37,476 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 22:02:37,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:39,360 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_948) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_949) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 2)))) is different from false [2023-11-21 22:02:39,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_947))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_946))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_949) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 2))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_948) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|)))) is different from false [2023-11-21 22:03:04,795 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 278 treesize of output 242 [2023-11-21 22:03:04,802 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 13 treesize of output 11 [2023-11-21 22:03:04,805 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 13 treesize of output 11 [2023-11-21 22:03:04,808 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 24 treesize of output 20 [2023-11-21 22:03:05,053 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:03:05,053 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 45 treesize of output 36 [2023-11-21 22:03:05,057 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 11 treesize of output 9 [2023-11-21 22:03:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-21 22:03:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246582707] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:05,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:05,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 67 [2023-11-21 22:03:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550080246] [2023-11-21 22:03:05,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:05,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-21 22:03:05,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-21 22:03:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=3941, Unknown=45, NotChecked=258, Total=4556 [2023-11-21 22:03:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:05,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:05,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.1940298507462686) internal successors, (214), 68 states have internal predecessors, (214), 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 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:12,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-21 22:03:12,767 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 22:03:12,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:12,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 330680942, now seen corresponding path program 1 times [2023-11-21 22:03:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131340516] [2023-11-21 22:03:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:03:12,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131340516] [2023-11-21 22:03:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131340516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:03:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528754842] [2023-11-21 22:03:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:13,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:13,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:13,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:03:13,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:13,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 203818540, now seen corresponding path program 1 times [2023-11-21 22:03:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825222837] [2023-11-21 22:03:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-21 22:03:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825222837] [2023-11-21 22:03:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825222837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:03:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827759264] [2023-11-21 22:03:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:13,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:03:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:03:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-21 22:03:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:13,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 22:03:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:03:13,880 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-11-21 22:03:13,881 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 22:03:13,884 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:13,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:03:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:13,885 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:03:13,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-11-21 22:03:13,905 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:03:13,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 22:03:13,906 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;@61b8df43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:13,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-21 22:03:13,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 22:03:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 225377730, now seen corresponding path program 1 times [2023-11-21 22:03:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781385669] [2023-11-21 22:03:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:13,929 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 22:03:13,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:13,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781385669] [2023-11-21 22:03:13,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781385669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:13,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:03:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177786285] [2023-11-21 22:03:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:13,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:03:13,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:03:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:03:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,931 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:13,931 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 22:03:13,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:13,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:03:13,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 22:03:13,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 82393490, now seen corresponding path program 1 times [2023-11-21 22:03:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46375275] [2023-11-21 22:03:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:14,021 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 22:03:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46375275] [2023-11-21 22:03:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46375275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:14,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:14,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126224120] [2023-11-21 22:03:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:14,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:14,025 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 22:03:14,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:03:14,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 22:03:14,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -899302659, now seen corresponding path program 1 times [2023-11-21 22:03:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993750167] [2023-11-21 22:03:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:14,161 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 22:03:14,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993750167] [2023-11-21 22:03:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993750167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431278672] [2023-11-21 22:03:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:14,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 22:03:14,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:03:14,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 22:03:14,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2118746579, now seen corresponding path program 1 times [2023-11-21 22:03:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238521871] [2023-11-21 22:03:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:14,377 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 22:03:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238521871] [2023-11-21 22:03:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238521871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043903379] [2023-11-21 22:03:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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 22:03:14,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:14,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:03:14,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 22:03:14,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1495719312, now seen corresponding path program 1 times [2023-11-21 22:03:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344395638] [2023-11-21 22:03:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:03:14,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:03:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:03:14,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:03:14,641 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:03:14,641 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-21 22:03:14,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-21 22:03:14,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-21 22:03:14,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:03:14,648 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-21 22:03:14,648 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 22:03:14,649 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:03:14,649 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:03:14,667 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:03:14,670 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:14,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:03:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:14,672 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:03:14,680 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:03:14,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 22:03:14,680 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;@61b8df43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:14,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:03:14,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-21 22:03:14,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:14,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1201538901, now seen corresponding path program 1 times [2023-11-21 22:03:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652499773] [2023-11-21 22:03:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:14,768 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 22:03:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652499773] [2023-11-21 22:03:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652499773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:03:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165564580] [2023-11-21 22:03:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:03:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:03:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:03:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:14,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 22:03:14,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:03:14,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:14,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1715190760, now seen corresponding path program 1 times [2023-11-21 22:03:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:14,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702251259] [2023-11-21 22:03:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:14,955 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 22:03:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702251259] [2023-11-21 22:03:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702251259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791797869] [2023-11-21 22:03:14,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:14,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:14,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 22:03:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:15,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:03:15,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:15,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1533621626, now seen corresponding path program 1 times [2023-11-21 22:03:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:15,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359414319] [2023-11-21 22:03:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359414319] [2023-11-21 22:03:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359414319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139603192] [2023-11-21 22:03:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:16,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:16,610 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:16,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 22:03:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:16,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-21 22:03:16,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:17,076 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:17,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:03:17,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:17,393 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 22:03:17,413 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:03:17,675 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 22:03:17,750 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 22:03:17,836 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 22:03:17,930 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 22:03:18,358 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 22:03:18,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:18,367 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 51 treesize of output 39 [2023-11-21 22:03:18,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,470 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 22:03:18,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,488 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 22:03:18,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,504 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 22:03:18,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,526 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 22:03:18,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:18,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:18,612 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 58 treesize of output 47 [2023-11-21 22:03:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:18,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:24,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) is different from false [2023-11-21 22:03:26,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1633 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0))))) is different from false [2023-11-21 22:03:27,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= 0 (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4)))))) is different from false [2023-11-21 22:03:27,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse9 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4)))))) is different from false [2023-11-21 22:03:27,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse10 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 0) .cse8 0) .cse10 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1633 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1632))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_27|) v_ArrVal_1633))) c_threadThread1of2ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5)))))) is different from false [2023-11-21 22:03:27,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:27,521 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 81 treesize of output 74 [2023-11-21 22:03:27,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:27,531 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 248 treesize of output 236 [2023-11-21 22:03:27,539 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 197 treesize of output 181 [2023-11-21 22:03:27,547 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 31 treesize of output 17 [2023-11-21 22:03:27,573 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 152 treesize of output 130 [2023-11-21 22:03:27,675 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:27,675 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 81 treesize of output 1 [2023-11-21 22:03:27,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:27,689 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 81 treesize of output 74 [2023-11-21 22:03:27,692 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:27,700 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:03:27,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-21 22:03:27,708 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 48 treesize of output 44 [2023-11-21 22:03:27,713 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 80 treesize of output 62 [2023-11-21 22:03:27,732 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:27,732 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 79 treesize of output 1 [2023-11-21 22:03:28,219 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 65 treesize of output 57 [2023-11-21 22:03:28,224 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 22:03:30,305 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1621 (Array Int Int))) (<= (+ 1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_1621 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-21 22:03:30,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_29| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_29|) (forall ((v_ArrVal_1621 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_29| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_29| Int)) (or (forall ((v_ArrVal_1621 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_29| v_ArrVal_1621) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_29|))))) is different from false [2023-11-21 22:03:30,727 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-21 22:03:30,727 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 45 treesize of output 36 [2023-11-21 22:03:30,731 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 11 treesize of output 9 [2023-11-21 22:03:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 22:03:30,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139603192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:30,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:30,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 66 [2023-11-21 22:03:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487382752] [2023-11-21 22:03:30,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:30,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-21 22:03:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-21 22:03:30,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3275, Unknown=51, NotChecked=854, Total=4422 [2023-11-21 22:03:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,838 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:30,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.106060606060606) internal successors, (205), 67 states have internal predecessors, (205), 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 22:03:30,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:30,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:37,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:38,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 22:03:38,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:38,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1060785728, now seen corresponding path program 1 times [2023-11-21 22:03:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009446588] [2023-11-21 22:03:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009446588] [2023-11-21 22:03:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009446588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951395166] [2023-11-21 22:03:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:42,499 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:42,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 22:03:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:42,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-21 22:03:42,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:43,231 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:43,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 22:03:43,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:43,238 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 22:03:43,781 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:43,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:03:43,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:43,794 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 22:03:44,059 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 22:03:44,150 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 22:03:44,244 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 22:03:44,357 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 22:03:44,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:44,982 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 22:03:45,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,013 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 22:03:45,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,048 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 22:03:45,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,088 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 22:03:45,186 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:45,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-21 22:03:45,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,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 16 treesize of output 11 [2023-11-21 22:03:45,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,266 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 52 treesize of output 41 [2023-11-21 22:03:45,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,315 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 45 treesize of output 53 [2023-11-21 22:03:45,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2023-11-21 22:03:45,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:45,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2023-11-21 22:03:51,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:51,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:03:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:57,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:04,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:04,077 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:10,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:16,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:16,577 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:16,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:16,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:16,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:16,927 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-11-21 22:04:17,119 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:04:17,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 110 [2023-11-21 22:04:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:17,126 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 22:04:25,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:25,828 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 124 treesize of output 88 [2023-11-21 22:04:25,848 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 22:04:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:25,979 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 58 treesize of output 43 [2023-11-21 22:04:26,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,011 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 58 treesize of output 43 [2023-11-21 22:04:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,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 58 treesize of output 43 [2023-11-21 22:04:26,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,087 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 58 treesize of output 43 [2023-11-21 22:04:26,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:26,303 INFO L349 Elim1Store]: treesize reduction 68, result has 42.9 percent of original size [2023-11-21 22:04:26,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 73 treesize of output 94 [2023-11-21 22:04:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:04:26,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:04:26,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0)))) is different from false [2023-11-21 22:04:26,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse2) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3) (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse2) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse2) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse2) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))))) is different from false [2023-11-21 22:04:28,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= 0 (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3) (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int)) (or (forall ((v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1911 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| .cse3))))))) is different from false [2023-11-21 22:04:29,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0))))) is different from false [2023-11-21 22:04:29,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse2))))) is different from false [2023-11-21 22:04:29,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse9 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0))))))) is different from false [2023-11-21 22:04:30,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base|) (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) |c_ULTIMATE.start_main_#t~nondet9#1|))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0))) (< .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (= (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse6 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse9 (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse10 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false [2023-11-21 22:04:30,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse4 (+ 2 |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse13)) (.cse5 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 .cse13)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store .cse3 .cse4 v_ArrVal_1894) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store .cse3 .cse4 v_ArrVal_1894) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store .cse3 .cse4 v_ArrVal_1894) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse10 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse11 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store .cse3 .cse4 v_ArrVal_1894) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse12 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-21 22:04:30,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 1 .cse14)) (.cse4 (+ 2 |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse14)) (.cse5 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 .cse14)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= 0 (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store .cse2 .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1894) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse7 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store .cse2 .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1894) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse9 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse7 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse10 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store .cse2 .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1894) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse11 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse7 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (< .cse7 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse12 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store .cse2 .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1894) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-21 22:04:30,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse15)) (.cse5 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 1 .cse15)) (.cse6 (+ 2 |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse15)) (.cse7 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 .cse15))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0))) (< .cse8 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse10 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0))) (< .cse8 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse11 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse12 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse8 |v_ULTIMATE.start_main_#t~mem12#1.base_19|))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (or (< .cse8 |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_36| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse13 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0)))))))) is different from false [2023-11-21 22:04:31,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse18)) (.cse5 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 1 .cse18)) (.cse6 (+ 2 |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse18)) (.cse7 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 .cse18)) (.cse8 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse8))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse10 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse8))) (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse8) (= (select (select (let ((.cse12 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse13 (select (select (store .cse14 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0))) (< (select (select .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse16 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1890) .cse5 |ULTIMATE.start_main_#t~nondet9#1|) .cse6 v_ArrVal_1894) .cse7 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse17 (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse8))))))))) is different from false [2023-11-21 22:04:31,253 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse17)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 1 .cse17)) (.cse5 (+ 2 |c_ULTIMATE.start_main_#t~mem8#1.offset| .cse17)) (.cse6 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 3 .cse17)) (.cse7 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse3 v_ArrVal_1890) .cse4 |ULTIMATE.start_main_#t~nondet9#1|) .cse5 v_ArrVal_1894) .cse6 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse2 (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse7)))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse3 v_ArrVal_1890) .cse4 |ULTIMATE.start_main_#t~nondet9#1|) .cse5 v_ArrVal_1894) .cse6 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse9 (select (select (store .cse10 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse7))) (< (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse7) (= (select (select (let ((.cse11 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse3 v_ArrVal_1890) .cse4 |ULTIMATE.start_main_#t~nondet9#1|) .cse5 v_ArrVal_1894) .cse6 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0))) (< (select (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse14 (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse3 v_ArrVal_1890) .cse4 |ULTIMATE.start_main_#t~nondet9#1|) .cse5 v_ArrVal_1894) .cse6 |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse15 (select (select (store .cse16 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse7))) (< (select (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))))) is different from false [2023-11-21 22:04:31,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse2 (store (store (store |c_#race| .cse1 (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 1 .cse5) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse3 (select (select (store .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6))) (< (select (select .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (= (select (select (let ((.cse7 (store (store (store |c_#race| .cse1 (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 1 .cse5) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0))) (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6) (= 0 (select (select (let ((.cse10 (store (store (store |c_#race| .cse1 (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 1 .cse5) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse11 (select (select (store .cse12 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (< (select (select .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= 0 (select (select (let ((.cse13 (store (store (store |c_#race| .cse1 (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 1 .cse5) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse14 (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| .cse6))) (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))))) is different from false [2023-11-21 22:04:34,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (= (select (select (let ((.cse3 (store (store (store |c_#race| .cse2 (let ((.cse6 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse6) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse4 (select (select (store .cse5 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0))) (< (select (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse7 (store (store (store |c_#race| .cse2 (let ((.cse10 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse10) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)))) (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse11 (store (store (store |c_#race| .cse2 (let ((.cse14 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse14) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)))) (< (select (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1890 Int) (v_ArrVal_1894 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (select (let ((.cse15 (store (store (store |c_#race| .cse2 (let ((.cse18 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse18) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse16 (select (select (store .cse17 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)))) (< (select (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))))))) is different from false [2023-11-21 22:04:36,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (= (select (select (let ((.cse4 (store (store (store |c_#race| .cse2 (let ((.cse6 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse6) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse5 (select (select (store .cse3 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= (select (select (let ((.cse7 (store (store (store |c_#race| .cse2 (let ((.cse10 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse10) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse10) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse8 (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (= (select (select (let ((.cse11 (store (store (store |c_#race| .cse2 (let ((.cse14 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse14) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse14) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (= (select (select (let ((.cse15 (store (store (store |c_#race| .cse2 (let ((.cse18 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse18) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse18) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse16 (select (select (store .cse17 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) is different from false [2023-11-21 22:04:37,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse12 0))) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (= (select (select (let ((.cse2 (store (store (store .cse5 .cse6 (let ((.cse7 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse6) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse7) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse7 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse7) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse7) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse3 (select (select (store .cse4 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (= (select (select (let ((.cse8 (store (store (store .cse5 .cse6 (let ((.cse11 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse6) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse11) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse11 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse11) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse11) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse9 (select (select (store .cse10 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse12) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1888))) (or (= (select (select (let ((.cse13 (store (store (store .cse5 .cse6 (let ((.cse16 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse6) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse16) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse14 (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse17 (store (store (store .cse5 .cse6 (let ((.cse20 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse6) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse20) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse18 (select (select (store .cse19 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse19 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))))) is different from false [2023-11-21 22:04:38,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse21 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 0) .cse21 0))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (= (select (select (let ((.cse0 (store (store (store .cse3 .cse4 (let ((.cse5 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse9 (store (store (store .cse3 .cse4 (let ((.cse12 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse12) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse10 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (= (select (select (let ((.cse13 (store (store (store .cse3 .cse4 (let ((.cse16 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse16) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse16) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse14 (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (= (select (select (let ((.cse17 (store (store (store .cse3 .cse4 (let ((.cse20 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse20) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse20) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse18 (select (select (store .cse19 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse21) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse19 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))))) is different from false [2023-11-21 22:04:41,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse13 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse18 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 0) .cse13 0) .cse18 0))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (= (select (select (let ((.cse0 (store (store (store .cse3 .cse4 (let ((.cse5 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse5) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse1 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (= (select (select (let ((.cse10 (store (store (store .cse3 .cse4 (let ((.cse12 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse12) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse12) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse11 (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse13) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (= (select (select (let ((.cse14 (store (store (store .cse3 .cse4 (let ((.cse17 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse17) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse17 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse17) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse17) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse15 (select (select (store .cse16 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) .cse18) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_36| Int) (v_ArrVal_1887 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1890 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1894 Int) (v_ArrVal_1905 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1911 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1888))) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse7) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse8) (= (select (select (let ((.cse19 (store (store (store .cse3 .cse4 (let ((.cse22 (* |v_ULTIMATE.start_main_~i~1#1_37| 4))) (store (store (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1887) .cse4) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse22) v_ArrVal_1890) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse22 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ 2 |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse22) v_ArrVal_1894) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| 3 .cse22) |ULTIMATE.start_main_#t~nondet9#1|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1909)) (.cse20 (select (select (store .cse21 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (store .cse19 .cse20 (store (select .cse19 .cse20) (+ (* |v_ULTIMATE.start_main_~i~1#1_36| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_31|) v_ArrVal_1911))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_31| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_36| (+ |v_ULTIMATE.start_main_~i~1#1_37| 1)) (< (select (select .cse21 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))))) is different from false [2023-11-21 22:04:41,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:41,438 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 247 treesize of output 194 [2023-11-21 22:04:41,762 INFO L349 Elim1Store]: treesize reduction 140, result has 49.6 percent of original size [2023-11-21 22:04:41,762 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 55492 treesize of output 53405 [2023-11-21 22:04:42,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8484 treesize of output 7858 [2023-11-21 22:04:42,204 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 493867 treesize of output 491307 [2023-11-21 22:04:42,935 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 9855 treesize of output 9487 [2023-11-21 22:04:43,073 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 9775 treesize of output 9623 [2023-11-21 22:05:02,539 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 31 treesize of output 17 [2023-11-21 22:05:03,776 INFO L349 Elim1Store]: treesize reduction 25, result has 88.2 percent of original size [2023-11-21 22:05:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 13966 treesize of output 12366 [2023-11-21 22:05:03,973 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 68 treesize of output 50 [2023-11-21 22:05:03,985 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 124 treesize of output 106 [2023-11-21 22:05:04,009 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 62 treesize of output 44 [2023-11-21 22:05:04,018 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 111 treesize of output 89 [2023-11-21 22:05:04,041 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 31 treesize of output 17 [2023-11-21 22:05:04,052 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 31 treesize of output 17 [2023-11-21 22:05:04,211 INFO L349 Elim1Store]: treesize reduction 25, result has 88.2 percent of original size [2023-11-21 22:05:04,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 13822 treesize of output 12230 [2023-11-21 22:05:04,352 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 62 treesize of output 44 [2023-11-21 22:05:04,379 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 6222 treesize of output 6144 [2023-11-21 22:05:04,483 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 834075 treesize of output 829677 [2023-11-21 22:05:05,432 INFO L349 Elim1Store]: treesize reduction 588, result has 29.9 percent of original size [2023-11-21 22:05:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 6950 treesize of output 7051 [2023-11-21 22:05:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 70 [2023-11-21 22:05:07,701 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 71 treesize of output 44 [2023-11-21 22:05:07,718 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 71 treesize of output 44 [2023-11-21 22:05:07,776 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 71 treesize of output 44 [2023-11-21 22:05:07,801 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 71 treesize of output 44 [2023-11-21 22:05:07,813 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 71 treesize of output 44 [2023-11-21 22:05:07,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:07,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 601 treesize of output 637 [2023-11-21 22:05:07,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:07,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2023-11-21 22:05:08,007 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 71 treesize of output 44 [2023-11-21 22:05:08,115 INFO L349 Elim1Store]: treesize reduction 116, result has 45.0 percent of original size [2023-11-21 22:05:08,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 197 treesize of output 250 [2023-11-21 22:05:08,127 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 142 treesize of output 95 [2023-11-21 22:05:08,364 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 71 treesize of output 44 [2023-11-21 22:05:08,377 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 71 treesize of output 44 [2023-11-21 22:05:08,417 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 71 treesize of output 44 [2023-11-21 22:05:09,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:09,551 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 245 treesize of output 192 [2023-11-21 22:05:09,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:09,759 INFO L349 Elim1Store]: treesize reduction 140, result has 49.6 percent of original size [2023-11-21 22:05:09,760 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 26500 treesize of output 24965 [2023-11-21 22:05:09,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:09,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:09,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4719 treesize of output 4217 [2023-11-21 22:05:10,016 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 84691 treesize of output 84435 [2023-11-21 22:05:10,367 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 5045 treesize of output 4983 [2023-11-21 22:05:10,446 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 5207 treesize of output 5175 [2023-11-21 22:05:17,919 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 31 treesize of output 17 [2023-11-21 22:05:18,714 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 225 treesize of output 205 [2023-11-21 22:05:18,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:18,954 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 9842 treesize of output 9756 [2023-11-21 22:05:19,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:19,735 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 11338 treesize of output 11260 [2023-11-21 22:05:19,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:19,830 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 27567 treesize of output 27291 [2023-11-21 22:05:20,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:20,164 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 31 treesize of output 17 [2023-11-21 22:05:20,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:20,189 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 2980 treesize of output 2956 [2023-11-21 22:05:20,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:20,345 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 15051 treesize of output 14971 [2023-11-21 22:05:21,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:21,307 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 7021 treesize of output 6957 [2023-11-21 22:05:21,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:21,610 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 31 treesize of output 17 [2023-11-21 22:05:21,844 INFO L349 Elim1Store]: treesize reduction 25, result has 88.2 percent of original size [2023-11-21 22:05:21,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 13816 treesize of output 12242 [2023-11-21 22:05:23,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:23,308 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 69408 treesize of output 69042 [2023-11-21 22:05:24,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:24,142 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 39226 treesize of output 39026 [2023-11-21 22:05:24,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:24,999 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 36533 treesize of output 36181 [2023-11-21 22:05:25,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:25,353 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 31 treesize of output 17 [2023-11-21 22:05:25,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:25,385 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 11338 treesize of output 11260 [2023-11-21 22:05:27,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:27,263 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 247 treesize of output 194 [2023-11-21 22:05:27,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:27,607 INFO L349 Elim1Store]: treesize reduction 140, result has 49.6 percent of original size [2023-11-21 22:05:27,607 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 62268 treesize of output 60245 [2023-11-21 22:05:27,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:27,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:27,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4996 treesize of output 4512 [2023-11-21 22:05:28,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 61873 treesize of output 61489 [2023-11-21 22:05:28,329 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 5101 treesize of output 4973 [2023-11-21 22:05:28,412 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 5261 treesize of output 5197 [2023-11-21 22:05:32,139 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 31 treesize of output 17 [2023-11-21 22:05:32,323 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 144 treesize of output 122 [2023-11-21 22:05:32,960 INFO L349 Elim1Store]: treesize reduction 588, result has 25.3 percent of original size [2023-11-21 22:05:32,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 206 treesize of output 320 [2023-11-21 22:05:33,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 199 treesize of output 275 [2023-11-21 22:05:33,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:33,085 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 403 treesize of output 385 [2023-11-21 22:05:33,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:33,251 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 892220 treesize of output 887334 [2023-11-21 22:05:34,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:34,056 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 55806 treesize of output 55340 [2023-11-21 22:05:34,656 INFO L349 Elim1Store]: treesize reduction 25, result has 88.2 percent of original size [2023-11-21 22:05:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 235 treesize of output 357 [2023-11-21 22:05:34,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:34,910 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 7247 treesize of output 7189 [2023-11-21 22:05:35,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:35,055 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 6272 treesize of output 6194 [2023-11-21 22:05:35,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:35,804 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 247 treesize of output 194 [2023-11-21 22:05:35,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:35,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:36,060 INFO L349 Elim1Store]: treesize reduction 144, result has 48.2 percent of original size [2023-11-21 22:05:36,060 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 19272 treesize of output 17845 [2023-11-21 22:05:36,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:36,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:36,186 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2023-11-21 22:05:36,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3030 treesize of output 2604 [2023-11-21 22:05:36,223 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 22491 treesize of output 22363 [2023-11-21 22:05:36,405 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 3425 treesize of output 3393 [2023-11-21 22:05:36,466 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 1512 treesize of output 1496 [2023-11-21 22:05:37,943 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 62 treesize of output 44 [2023-11-21 22:05:38,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:38,428 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 9157 treesize of output 9073 [2023-11-21 22:05:38,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:38,517 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 6563 treesize of output 6509 [2023-11-21 22:05:39,035 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse9 (= c_threadThread1of2ForFork0_~p~0.base .cse2)) (.cse17 (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= .cse2 (select (select (store .cse88 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse88 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (.cse53 (< c_threadThread1of2ForFork0_~p~0.offset (+ .cse18 4 .cse6))) (.cse29 (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse2))) (let ((.cse37 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6))))) (.cse33 (not (= |c_ULTIMATE.start_main_~#is~0#1.base| c_threadThread1of2ForFork0_~p~0.base))) (.cse30 (not .cse29)) (.cse23 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse87 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse87 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (.cse5 (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse86 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse86 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< (select (select .cse86 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (.cse67 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (not (= .cse2 (select (select (store .cse85 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse85 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (.cse68 (or .cse17 .cse53)) (.cse3 (< c_threadThread1of2ForFork0_~p~0.offset (+ .cse18 3 .cse6))) (.cse10 (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_threadThread1of2ForFork0_~p~0.base))) (.cse49 (< c_threadThread1of2ForFork0_~p~0.offset (+ .cse18 1 .cse6))) (.cse75 (< c_threadThread1of2ForFork0_~p~0.offset (+ 5 .cse18 .cse6))) (.cse4 (not .cse9)) (.cse19 (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= .cse2 (select (select (store .cse84 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< (select (select .cse84 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_561 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_561) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse0 c_threadThread1of2ForFork0_~p~0.base)) (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or .cse3 .cse4 .cse5) (or .cse4 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (not (= .cse2 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse8 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (< (select (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (or .cse9 (and .cse10 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_707 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_707) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (or .cse4 (forall ((v_ArrVal_1889 (Array Int Int)) (v_prenex_559 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (not (= .cse2 (select (select (store .cse12 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_559) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse13 (select (select (store .cse14 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse13)) (= .cse2 .cse13) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (< (select (select .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse15 (select (select (store .cse16 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse15)) (= .cse2 .cse15) (< (select (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6)))))) (or .cse9 .cse10 .cse17) (or .cse4 (< c_threadThread1of2ForFork0_~p~0.offset (+ .cse18 6 .cse6)) .cse19) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_562 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_562) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse20 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse21 (select (select (store .cse22 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse21)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (not (= .cse2 .cse21)) (< (select (select .cse22 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or .cse10 .cse17) (or .cse9 (and .cse23 (or (and (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< (select (select .cse24 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (forall ((v_ArrVal_1905 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select (store .cse24 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (forall ((v_ArrVal_1905 (Array Int Int))) (let ((.cse25 (select (select (store .cse26 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (= .cse2 .cse25) (= c_threadThread1of2ForFork0_~p~0.base .cse25)))) (< (select (select .cse26 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) .cse10))) (or (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_564 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse27 (select (select (store .cse28 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_564) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse27)) (= .cse2 .cse27) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse28 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) .cse29) (or (and (or .cse30 (forall ((v_ArrVal_1889 (Array Int Int)) (v_prenex_180 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse31 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_180) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse31 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6)))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse32 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse32 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6))))) .cse33 (or (and (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_178 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse34 (select (select (store .cse35 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_178) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (= c_threadThread1of2ForFork0_~p~0.base .cse34) (= .cse2 .cse34) (< (select (select .cse35 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= .cse2 (select (select (store .cse36 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< (select (select .cse36 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6)))))) .cse10) (or (and .cse37 (forall ((v_ArrVal_1888 (Array Int Int)) (v_prenex_182 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int)) (let ((.cse38 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= (select (select (store .cse38 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_182) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base) (< (select (select .cse38 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) .cse10)) .cse9) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_554 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse39 (select (select (store .cse40 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_554) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= .cse39 .cse2)) (not (= .cse39 c_threadThread1of2ForFork0_~p~0.base)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse40 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse41 (select (select (store .cse42 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse41)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse41)) (not (= .cse2 .cse41)) (< (select (select .cse42 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or (and (or (and .cse37 (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_158 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse43 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_158) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< (select (select .cse43 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) .cse10) .cse33 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_155 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse44 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_155) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) (< (select (select .cse44 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= .cse2 (select (select (store .cse45 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse45 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_153 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< (select (select .cse46 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse46 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_153) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6))))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_157 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse47 (select (select (store .cse48 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_157) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= .cse47 c_threadThread1of2ForFork0_~p~0.base)) (< (select (select .cse48 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (not (= .cse47 |c_ULTIMATE.start_main_~#tids~0#1.base|))))))) .cse4) (or .cse4 .cse49 .cse5) (or (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_731 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse50 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse50 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) .cse30) (or .cse23 .cse9) (or .cse4 .cse17 .cse49) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_557 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse51 (select (select (store .cse52 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_557) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= .cse51 c_threadThread1of2ForFork0_~p~0.base)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse52 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (= .cse51 .cse2))))) (or (and .cse10 (or .cse4 .cse53)) .cse5) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse54 (select (select (store .cse55 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse54)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse54)) (< (select (select .cse55 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse56 (select (select (store .cse57 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse56)) (not (= .cse2 .cse56)) (< (select (select .cse57 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ 7 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse6)))))) (or .cse10 .cse29) (or .cse9 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse58 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 6 .cse6)) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse58 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse58 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or .cse3 (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse59 (select (select (store .cse60 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse59)) (not (= .cse2 .cse59)) (< (select (select .cse60 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (or (and (or (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_551 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse61 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_551) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) (< (select (select .cse61 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) .cse53) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_551 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse62 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_551) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse62 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) .cse4) (or (and .cse10 (or .cse3 .cse4)) .cse5) (or (and (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_567 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select (store .cse63 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_567) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse63 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_566 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= (select (select (store .cse64 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_566) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse2) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse64 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse65 (select (select (store .cse66 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (= .cse2 .cse65) (= c_threadThread1of2ForFork0_~p~0.base .cse65) (< (select (select .cse66 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) .cse10) (or .cse4 (and .cse67 .cse68)) (or (and .cse67 (forall ((v_prenex_547 (Array Int Int)) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse69 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_547) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse2)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse69 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) .cse68) .cse4) (or (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse70 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store .cse70 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (< (select (select .cse70 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) .cse10) (or .cse4 (let ((.cse72 (< c_threadThread1of2ForFork0_~p~0.offset (+ .cse18 2 .cse6))) (.cse71 (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_764 (Array Int Int)) (v_prenex_765 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_764))) (or (not (= (select (select (store .cse76 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_765) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse2)) (< (select (select .cse76 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) (and (or .cse71 .cse53) (or .cse72 (forall ((v_prenex_767 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_766 (Array Int Int))) (let ((.cse73 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_766))) (or (= (select (select (store .cse73 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_767) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base) (< (select (select .cse73 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_764 (Array Int Int)) (v_prenex_765 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_764))) (or (not (= (select (select (store .cse74 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_765) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse2)) (< (select (select .cse74 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 6 .cse6))))) (or .cse71 .cse72) (or .cse71 .cse3) (or .cse71 .cse75)))) (or (and (or .cse49 (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_733 (Array Int Int))) (let ((.cse77 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse77 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_733) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) .cse2)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 5 .cse6)) (< (select (select .cse77 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or .cse17 .cse49)) .cse4) (or .cse10 .cse19) (or (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1904 (Array Int Int)) (v_prenex_555 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (= .cse2 (select (select (store .cse78 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_555) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (< c_threadThread1of2ForFork0_~p~0.offset (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1889) |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1904) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 8 .cse6)) (< (select (select .cse78 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_552 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (or (not (= (select (select (store .cse79 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_552) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|)) (< (select (select .cse79 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_prenex_553 (Array Int Int))) (let ((.cse81 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse80 (select (select (store .cse81 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_prenex_553) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (= .cse80 .cse2) (= .cse80 c_threadThread1of2ForFork0_~p~0.base) (< (select (select .cse81 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|)))))) .cse10) (or .cse4 .cse19 .cse53) (forall ((v_ArrVal_1888 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_19| Int) (v_ArrVal_1905 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1888))) (let ((.cse82 (select (select (store .cse83 |v_ULTIMATE.start_main_#t~mem12#1.base_19| v_ArrVal_1905) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (or (not (= c_threadThread1of2ForFork0_~p~0.base .cse82)) (= .cse2 .cse82) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse82)) (< (select (select .cse83 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_19|))))) (or .cse4 .cse19 .cse49) (or .cse75 .cse4 .cse19))))) is different from false Killed by 15