./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:02:00,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:02:00,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:02:00,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:02:00,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:02:00,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:02:00,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:02:00,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:02:00,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:02:00,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:02:00,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:02:00,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:02:00,486 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:02:00,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:02:00,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:02:00,490 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:02:00,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:02:00,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:02:00,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:02:00,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:02:00,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:02:00,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:02:00,492 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:02:00,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:02:00,493 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:02:00,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:02:00,493 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:02:00,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:02:00,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:02:00,494 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:02:00,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:02:00,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:02:00,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:02:00,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:02:00,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:02:00,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:02:00,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:02:00,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:02:00,496 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:02:00,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:02:00,497 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:02:00,497 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:02:00,497 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:02:00,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-11-21 22:02:00,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:02:00,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:02:00,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:02:00,740 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:02:00,740 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:02:00,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-21 22:02:01,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:02:02,096 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:02:02,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-21 22:02:02,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b70509bc3/9239dffe679248ce972bed7327eadcde/FLAGcd232d59d [2023-11-21 22:02:02,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b70509bc3/9239dffe679248ce972bed7327eadcde [2023-11-21 22:02:02,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:02:02,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:02:02,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:02:02,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:02:02,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:02:02,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcca561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02, skipping insertion in model container [2023-11-21 22:02:02,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,187 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:02:02,335 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:02:02,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:02:02,508 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:02:02,530 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:02:02,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:02:02,584 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:02:02,590 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:02:02,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02 WrapperNode [2023-11-21 22:02:02,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:02:02,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:02:02,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:02:02,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:02:02,598 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:02:02" (1/1) ... [2023-11-21 22:02:02,622 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:02:02" (1/1) ... [2023-11-21 22:02:02,653 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-21 22:02:02,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:02:02,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:02:02,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:02:02,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:02:02,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:02:02,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:02:02,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:02:02,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:02:02,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:02:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:02,803 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:02:02,805 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:02:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:02:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:02:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:02:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:02:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:02:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:02:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:02:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:02:02,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:02:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:02:02,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:02:02,880 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:02:03,024 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:02:03,026 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:02:03,297 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:02:03,305 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:02:03,305 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:02:03,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:03 BoogieIcfgContainer [2023-11-21 22:02:03,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:02:03,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:02:03,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:02:03,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:02:03,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:02:02" (1/3) ... [2023-11-21 22:02:03,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652d567c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:03, skipping insertion in model container [2023-11-21 22:02:03,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (2/3) ... [2023-11-21 22:02:03,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652d567c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:03, skipping insertion in model container [2023-11-21 22:02:03,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:03" (3/3) ... [2023-11-21 22:02:03,318 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-21 22:02:03,323 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:02:03,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:02:03,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 22:02:03,331 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:02:03,399 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:02:03,438 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:03,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:02:03,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:03,440 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:02:03,469 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:02:03,509 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:02:03,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:02:03,524 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;@6b68a994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:03,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:02:03,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:03,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-11-21 22:02:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722791288] [2023-11-21 22:02:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:04,008 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:02:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722791288] [2023-11-21 22:02:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722791288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:04,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:04,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542369936] [2023-11-21 22:02:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:02:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:02:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:02:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:04,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:04,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:02:04,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:04,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-21 22:02:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793441335] [2023-11-21 22:02:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:04,611 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:02:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:04,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793441335] [2023-11-21 22:02:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793441335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:04,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:02:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967871351] [2023-11-21 22:02:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:04,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:04,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:04,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:04,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:02:04,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:04,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-11-21 22:02:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:04,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822815430] [2023-11-21 22:02:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822815430] [2023-11-21 22:02:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822815430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612534934] [2023-11-21 22:02:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:05,677 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:02:05,704 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:02:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:05,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-21 22:02:05,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:05,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 22:02:05,976 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:06,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:06,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:06,056 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:06,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:06,143 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:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:06,329 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:02:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:06,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:08,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2))))))) is different from false [2023-11-21 22:02:12,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:02:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612534934] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:12,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 22:02:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908919247] [2023-11-21 22:02:12,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 22:02:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 22:02:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=912, Unknown=22, NotChecked=62, Total=1122 [2023-11-21 22:02:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:12,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:12,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:12,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:13,633 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:02:13,815 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:02:13,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:13,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-11-21 22:02:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903167871] [2023-11-21 22:02:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:14,497 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:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903167871] [2023-11-21 22:02:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903167871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565812679] [2023-11-21 22:02:14,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:14,513 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:02:14,539 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:02:14,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:14,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:14,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-21 22:02:14,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:14,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 22:02:14,809 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:14,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:14,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:14,873 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:14,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:14,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:02:15,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:15,148 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:02:15,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:15,176 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:02:15,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:15,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:15,208 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:02:15,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:15,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:15,287 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:15,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:15,380 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:15,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:15,491 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:15,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 22:02:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 22:02:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565812679] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:15,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-21 22:02:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989505000] [2023-11-21 22:02:15,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:15,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-21 22:02:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-21 22:02:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1119, Unknown=9, NotChecked=210, Total=1482 [2023-11-21 22:02:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:15,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:15,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.421052631578948) internal successors, (168), 39 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:15,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:15,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:15,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:15,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:17,001 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:17,183 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:17,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:17,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-11-21 22:02:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:17,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096699265] [2023-11-21 22:02:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096699265] [2023-11-21 22:02:18,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096699265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:18,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389290881] [2023-11-21 22:02:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:18,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:18,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:18,037 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:18,078 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:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:18,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 22:02:18,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:18,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:18,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:18,331 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:18,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:18,741 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:02:18,742 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 72 treesize of output 66 [2023-11-21 22:02:19,010 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:19,010 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 64 treesize of output 52 [2023-11-21 22:02:19,055 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:19,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:19,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:19,195 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:19,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:19,281 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:19,672 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:02:19,673 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 63 treesize of output 40 [2023-11-21 22:02:19,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:19,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:19,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:19,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:19,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:19,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:19,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:19,837 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:02:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:19,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:20,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:20,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:20,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:20,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:20,835 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 114 treesize of output 103 [2023-11-21 22:02:20,842 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 65 treesize of output 63 [2023-11-21 22:02:21,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:21,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 166 [2023-11-21 22:02:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:02:21,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389290881] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:21,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 49 [2023-11-21 22:02:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207070266] [2023-11-21 22:02:21,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:02:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:02:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1927, Unknown=50, NotChecked=276, Total=2450 [2023-11-21 22:02:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:21,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.4693877551020407) internal successors, (170), 50 states have internal predecessors, (170), 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:21,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:21,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:21,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:21,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:21,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:24,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:02:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:02:24,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:02:24,830 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:24,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:24,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-11-21 22:02:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678902762] [2023-11-21 22:02:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:25,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678902762] [2023-11-21 22:02:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678902762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:25,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301852033] [2023-11-21 22:02:25,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:25,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:25,580 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:25,591 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:25,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:25,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:25,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-21 22:02:25,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:25,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:25,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:25,815 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:25,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:26,382 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:02:26,382 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 88 treesize of output 78 [2023-11-21 22:02:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:26,393 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:02:26,394 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 38 treesize of output 26 [2023-11-21 22:02:26,716 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:26,717 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 64 treesize of output 52 [2023-11-21 22:02:26,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:26,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:26,727 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:02:26,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-21 22:02:26,780 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:26,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:26,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:26,949 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:27,429 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:02:27,429 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 63 treesize of output 40 [2023-11-21 22:02:27,441 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:02:27,442 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 29 treesize of output 13 [2023-11-21 22:02:27,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:27,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:02:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:02:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:27,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:27,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:27,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:27,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2023-11-21 22:02:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:27,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:27,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:27,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6)))))) is different from false [2023-11-21 22:02:27,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:28,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) is different from false [2023-11-21 22:02:30,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))))) is different from false [2023-11-21 22:02:32,608 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (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_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 22:02:34,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 22:02:34,704 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:02:34,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 838 treesize of output 792 [2023-11-21 22:02:34,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:34,720 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 354 treesize of output 324 [2023-11-21 22:02:34,728 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 240 treesize of output 224 [2023-11-21 22:02:34,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:34,887 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 22:02:34,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 320 treesize of output 247 [2023-11-21 22:02:34,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2023-11-21 22:02:34,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:34,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 158 [2023-11-21 22:02:34,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:34,925 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:02:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 336 treesize of output 1 [2023-11-21 22:02:34,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:34,938 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:02:34,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 336 treesize of output 1 [2023-11-21 22:02:35,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:35,808 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 146 treesize of output 131 [2023-11-21 22:02:35,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:35,835 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 116 treesize of output 125 [2023-11-21 22:02:35,841 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 92 treesize of output 90 [2023-11-21 22:02:35,847 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 90 treesize of output 88 [2023-11-21 22:02:39,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 306 treesize of output 323 [2023-11-21 22:02:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:02:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301852033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:39,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 60 [2023-11-21 22:02:39,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237093323] [2023-11-21 22:02:39,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:39,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-21 22:02:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-21 22:02:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2633, Unknown=13, NotChecked=770, Total=3660 [2023-11-21 22:02:39,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:39,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:39,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.0) internal successors, (180), 61 states have internal predecessors, (180), 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:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:02:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:02:39,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:02:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:02:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:02:44,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:02:44,955 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:44,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:44,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-11-21 22:02:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30168075] [2023-11-21 22:02:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30168075] [2023-11-21 22:02:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30168075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837764314] [2023-11-21 22:02:45,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:02:45,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:45,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:45,634 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:45,635 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:45,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:02:45,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:45,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:02:45,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:45,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:45,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:45,859 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:45,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:46,194 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:46,194 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 71 treesize of output 57 [2023-11-21 22:02:46,395 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:46,395 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 64 treesize of output 52 [2023-11-21 22:02:46,419 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:46,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:46,728 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:02:46,728 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 63 treesize of output 40 [2023-11-21 22:02:46,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:46,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-21 22:02:46,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 22:02:46,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:46,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:02:46,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:46,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:46,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:46,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:46,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:46,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:46,925 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:02:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:46,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:46,940 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:47,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:47,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:47,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:47,554 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 92 treesize of output 97 [2023-11-21 22:02:47,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:47,557 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 121 treesize of output 87 [2023-11-21 22:02:47,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-11-21 22:02:47,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-21 22:02:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:47,572 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-21 22:02:47,573 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 23 treesize of output 1 [2023-11-21 22:02:47,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:47,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:47,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:47,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:48,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:48,076 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 113 treesize of output 106 [2023-11-21 22:02:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2023-11-21 22:02:48,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:48,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 121 [2023-11-21 22:02:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837764314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:48,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 50 [2023-11-21 22:02:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78363183] [2023-11-21 22:02:48,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-21 22:02:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-21 22:02:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1999, Unknown=75, NotChecked=282, Total=2550 [2023-11-21 22:02:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:48,298 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:48,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.4) internal successors, (170), 51 states have internal predecessors, (170), 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:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:02:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:02:48,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:02:48,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 22:02:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:02:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 22:02:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:02:52,282 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:02:52,468 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:02:52,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:52,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1748119725, now seen corresponding path program 4 times [2023-11-21 22:02:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151644233] [2023-11-21 22:02:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151644233] [2023-11-21 22:02:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151644233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042579642] [2023-11-21 22:02:53,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:02:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:53,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:53,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:02:53,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:02:53,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:53,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-21 22:02:53,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:53,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:53,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:53,640 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:53,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:53,815 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:54,120 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:02:54,121 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 72 treesize of output 66 [2023-11-21 22:02:54,320 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:54,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 64 treesize of output 52 [2023-11-21 22:02:54,343 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:54,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:02:54,544 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 63 treesize of output 35 [2023-11-21 22:02:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:54,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:02:54,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:02:54,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:02:54,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:02:54,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:54,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:54,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:54,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:54,805 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:02:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:54,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:54,844 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:55,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:55,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 22:02:55,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:55,513 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 114 treesize of output 100 [2023-11-21 22:02:55,516 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 65 treesize of output 63 [2023-11-21 22:02:55,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:55,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 256 [2023-11-21 22:02:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042579642] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:55,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51 [2023-11-21 22:02:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505833870] [2023-11-21 22:02:55,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:55,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 22:02:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 22:02:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2180, Unknown=72, NotChecked=194, Total=2652 [2023-11-21 22:02:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:55,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:55,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 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:55,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:55,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:02:55,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-21 22:03:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:03:01,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-21 22:03:01,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-21 22:03:01,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:01,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1504699717, now seen corresponding path program 5 times [2023-11-21 22:03:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782491813] [2023-11-21 22:03:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782491813] [2023-11-21 22:03:01,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782491813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548373414] [2023-11-21 22:03:01,854 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:03:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:01,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:01,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:01,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 22:03:01,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:03:01,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:03:01,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-21 22:03:01,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:02,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:03:02,030 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:03:02,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 22:03:02,117 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-21 22:03:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2023-11-21 22:03:02,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:02,158 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:03:02,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-11-21 22:03:02,454 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-21 22:03:02,455 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 62 treesize of output 62 [2023-11-21 22:03:02,472 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 18 [2023-11-21 22:03:02,712 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-21 22:03:02,713 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 71 treesize of output 63 [2023-11-21 22:03:02,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:02,888 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 70 treesize of output 50 [2023-11-21 22:03:02,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:03:02,951 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:02,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:02,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 22:03:03,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:03,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:03:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:03,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:03,138 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:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:03,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:03,155 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:03:03,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 22:03:03,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:03,850 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 114 treesize of output 103 [2023-11-21 22:03:03,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 65 treesize of output 63 [2023-11-21 22:03:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:04,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548373414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:04,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:04,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2023-11-21 22:03:04,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30962244] [2023-11-21 22:03:04,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:03:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:03:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2008, Unknown=58, NotChecked=186, Total=2450 [2023-11-21 22:03:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:04,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:04,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.204081632653061) internal successors, (157), 50 states have internal predecessors, (157), 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:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:03:04,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:03:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:03:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-21 22:03:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-21 22:03:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-21 22:03:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:03:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:03:19,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 22:03:19,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-21 22:03:19,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:19,632 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2023-11-21 22:03:19,635 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 22:03:19,639 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:19,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:03:19,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:19,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:03:19,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-21 22:03:19,659 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:03:19,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 22:03:19,660 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;@6b68a994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:19,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 22:03:19,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:03:19,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1375234035, now seen corresponding path program 1 times [2023-11-21 22:03:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557784922] [2023-11-21 22:03:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:19,721 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:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557784922] [2023-11-21 22:03:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557784922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:03:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863937593] [2023-11-21 22:03:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:03:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:03:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:03:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:19,723 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:19,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:03:19,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:03:19,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-21 22:03:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198002508] [2023-11-21 22:03:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:19,816 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:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198002508] [2023-11-21 22:03:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198002508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739391118] [2023-11-21 22:03:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:19,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:19,818 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:19,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:19,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:03:19,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:03:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1614691510, now seen corresponding path program 1 times [2023-11-21 22:03:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868536783] [2023-11-21 22:03:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:19,969 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:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868536783] [2023-11-21 22:03:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868536783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729078529] [2023-11-21 22:03:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:19,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:19,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:19,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:19,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:20,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:03:20,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:03:20,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-21 22:03:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985433663] [2023-11-21 22:03:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:03:20,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:03:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:03:20,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:03:20,154 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:03:20,155 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 22:03:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 22:03:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 22:03:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-21 22:03:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 22:03:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 22:03:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 22:03:20,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:03:20,161 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 22:03:20,161 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 22:03:20,162 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:03:20,162 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:03:20,181 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:03:20,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:03:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:20,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:03:20,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-11-21 22:03:20,220 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:03:20,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 22:03:20,221 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;@6b68a994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:03:20,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:03:20,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:20,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -968901882, now seen corresponding path program 1 times [2023-11-21 22:03:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562806261] [2023-11-21 22:03:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562806261] [2023-11-21 22:03:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562806261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:20,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:20,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:03:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571508313] [2023-11-21 22:03:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:20,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:03:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:03:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:03:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:20,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:20,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:03:20,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:20,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1206880, now seen corresponding path program 1 times [2023-11-21 22:03:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016876217] [2023-11-21 22:03:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:20,493 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:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:20,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016876217] [2023-11-21 22:03:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016876217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:03:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152848637] [2023-11-21 22:03:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:20,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:20,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:20,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:03:20,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:20,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 484097772, now seen corresponding path program 1 times [2023-11-21 22:03:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660450354] [2023-11-21 22:03:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660450354] [2023-11-21 22:03:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660450354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821526200] [2023-11-21 22:03:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:21,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:21,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:21,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:21,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 22:03:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:21,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-21 22:03:21,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:21,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 22:03:21,362 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:21,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:03:21,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:21,420 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:03:21,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:21,454 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:03:21,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:21,572 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:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:21,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:21,592 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2023-11-21 22:03:21,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:03:21,659 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:03:23,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:03:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 22:03:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821526200] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:23,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 22:03:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235004747] [2023-11-21 22:03:23,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:23,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 22:03:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:23,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 22:03:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=821, Unknown=3, NotChecked=180, Total=1122 [2023-11-21 22:03:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:23,808 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:23,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:23,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:23,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:23,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:27,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:27,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:27,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash 127283813, now seen corresponding path program 2 times [2023-11-21 22:03:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:27,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417015951] [2023-11-21 22:03:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:28,373 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:03:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417015951] [2023-11-21 22:03:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417015951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148818004] [2023-11-21 22:03:28,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:03:28,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:28,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:28,392 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 22:03:28,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:03:28,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:03:28,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 22:03:28,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:28,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 22:03:28,707 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:28,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:03:28,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:28,765 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:03:28,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:28,805 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:03:28,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:28,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:28,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:28,943 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:28,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:28,956 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:28,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:28,970 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:29,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:29,032 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:29,036 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:03:29,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:29,047 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:03:29,072 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false [2023-11-21 22:03:29,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:03:29,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2023-11-21 22:03:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 22:03:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-21 22:03:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148818004] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:29,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:29,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-21 22:03:29,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281229102] [2023-11-21 22:03:29,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:29,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-21 22:03:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-21 22:03:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1062, Unknown=4, NotChecked=276, Total=1482 [2023-11-21 22:03:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:29,422 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:29,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.421052631578948) internal successors, (168), 39 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:29,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:29,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:29,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:29,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:30,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:30,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 22:03:30,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:30,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1664817300, now seen corresponding path program 1 times [2023-11-21 22:03:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:30,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516047358] [2023-11-21 22:03:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-21 22:03:30,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516047358] [2023-11-21 22:03:30,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516047358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:30,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:30,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:03:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048447808] [2023-11-21 22:03:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:30,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:30,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:30,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:30,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:30,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:30,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:03:30,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:30,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1264413843, now seen corresponding path program 1 times [2023-11-21 22:03:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041769306] [2023-11-21 22:03:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-21 22:03:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041769306] [2023-11-21 22:03:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041769306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:03:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:03:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:03:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174814893] [2023-11-21 22:03:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:03:31,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:03:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:03:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:03:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:31,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:31,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:31,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:03:31,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:31,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1206707519, now seen corresponding path program 1 times [2023-11-21 22:03:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195715608] [2023-11-21 22:03:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195715608] [2023-11-21 22:03:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195715608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23090384] [2023-11-21 22:03:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:33,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:33,181 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:33,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 22:03:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:33,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-21 22:03:33,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:03:33,813 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:33,814 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:34,025 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:34,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-21 22:03:34,029 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 9 treesize of output 7 [2023-11-21 22:03:34,045 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:34,046 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:34,111 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:34,175 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:34,253 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:34,349 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:34,900 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:34,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:34,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:34,905 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 27 treesize of output 13 [2023-11-21 22:03:35,008 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:35,015 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 27 treesize of output 13 [2023-11-21 22:03:35,115 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:35,124 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 27 treesize of output 13 [2023-11-21 22:03:35,214 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,225 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 27 treesize of output 13 [2023-11-21 22:03:35,510 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,520 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 27 treesize of output 13 [2023-11-21 22:03:35,623 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:35,628 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 27 treesize of output 13 [2023-11-21 22:03:35,724 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:35,729 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 27 treesize of output 13 [2023-11-21 22:03:35,816 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:35,826 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 27 treesize of output 13 [2023-11-21 22:03:35,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:35,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-21 22:03:35,927 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:35,942 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:35,943 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 66 treesize of output 54 [2023-11-21 22:03:35,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:35,952 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:36,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,186 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:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,208 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:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,224 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:36,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,243 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:36,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,359 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:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,374 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:36,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,388 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:36,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,402 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:36,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:36,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:36,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 22:03:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:36,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:37,901 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:03:38,028 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:03:38,229 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:03:38,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))))) is different from false [2023-11-21 22:03:38,625 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:03:38,654 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))))) is different from false [2023-11-21 22:03:38,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:03:38,848 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= (select (select (let ((.cse6 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse8))))))) is different from false [2023-11-21 22:03:38,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse9 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse6)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse9))))))) is different from false [2023-11-21 22:03:38,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:38,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 22:03:38,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:38,919 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 2858 treesize of output 2600 [2023-11-21 22:03:38,940 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 866 treesize of output 802 [2023-11-21 22:03:38,953 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 874 treesize of output 842 [2023-11-21 22:03:39,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:39,456 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 111 treesize of output 77 [2023-11-21 22:03:39,475 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:39,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-21 22:03:39,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:39,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 22:03:39,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:39,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:39,498 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:03:39,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 264 [2023-11-21 22:03:39,506 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 89 treesize of output 85 [2023-11-21 22:03:39,514 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 193 treesize of output 185 [2023-11-21 22:03:39,520 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 236 treesize of output 178 [2023-11-21 22:03:39,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 22:03:39,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:39,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:39,564 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:03:39,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 216 [2023-11-21 22:03:39,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2023-11-21 22:03:39,581 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 211 treesize of output 165 [2023-11-21 22:03:39,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2023-11-21 22:03:40,229 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 73 treesize of output 65 [2023-11-21 22:03:40,234 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:40,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:40,639 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 54 treesize of output 67 [2023-11-21 22:03:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 22:03:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23090384] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:40,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2023-11-21 22:03:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887710161] [2023-11-21 22:03:40,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:40,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-21 22:03:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-21 22:03:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3899, Unknown=12, NotChecked=1206, Total=5402 [2023-11-21 22:03:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:40,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:40,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.8904109589041096) internal successors, (284), 74 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:40,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:40,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:40,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:03:54,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-21 22:03:54,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:54,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:54,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 720158051, now seen corresponding path program 1 times [2023-11-21 22:03:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062595969] [2023-11-21 22:03:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062595969] [2023-11-21 22:03:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062595969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651977975] [2023-11-21 22:03:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:55,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:55,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:55,394 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:55,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 22:03:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:55,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-21 22:03:55,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:55,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:03:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:55,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:03:55,694 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:03:55,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:03:56,049 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:56,050 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 71 treesize of output 57 [2023-11-21 22:03:56,240 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:03:56,240 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 64 treesize of output 52 [2023-11-21 22:03:56,275 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:56,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:03:56,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:56,411 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:03:56,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:56,487 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:03:56,746 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:56,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:56,756 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 27 treesize of output 13 [2023-11-21 22:03:56,818 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:56,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:56,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:56,823 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 27 treesize of output 13 [2023-11-21 22:03:56,900 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:56,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:56,910 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 27 treesize of output 13 [2023-11-21 22:03:56,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:56,977 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:57,209 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:57,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:57,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:57,225 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 27 treesize of output 13 [2023-11-21 22:03:57,293 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:57,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:57,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:57,300 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 27 treesize of output 13 [2023-11-21 22:03:57,384 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:57,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:57,396 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 27 treesize of output 13 [2023-11-21 22:03:57,466 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:03:57,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:03:57,477 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 27 treesize of output 13 [2023-11-21 22:03:57,566 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:03:57,566 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 72 treesize of output 66 [2023-11-21 22:03:57,781 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:03:57,781 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 63 treesize of output 40 [2023-11-21 22:03:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:57,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:57,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:57,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:57,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:57,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:57,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:03:57,878 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:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:57,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:58,354 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:03:58,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-21 22:03:58,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:03:58,537 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:03:58,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:03:58,563 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:03:58,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,574 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 52 treesize of output 68 [2023-11-21 22:03:58,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 932 treesize of output 750 [2023-11-21 22:03:58,586 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 158 treesize of output 142 [2023-11-21 22:03:58,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2023-11-21 22:03:58,592 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 65 treesize of output 61 [2023-11-21 22:03:58,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,618 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 4 case distinctions, treesize of input 50 treesize of output 66 [2023-11-21 22:03:58,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 52 [2023-11-21 22:03:58,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,630 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 4 case distinctions, treesize of input 52 treesize of output 68 [2023-11-21 22:03:58,631 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 54 [2023-11-21 22:03:58,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,642 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 4 case distinctions, treesize of input 52 treesize of output 68 [2023-11-21 22:03:58,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:58,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:58,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 54 [2023-11-21 22:03:59,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:59,437 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 4055 treesize of output 3124 [2023-11-21 22:03:59,455 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 288 treesize of output 278 [2023-11-21 22:03:59,460 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 278 treesize of output 268 [2023-11-21 22:03:59,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 268 treesize of output 256 [2023-11-21 22:03:59,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:59,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 168 [2023-11-21 22:03:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2023-11-21 22:03:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651977975] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:59,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 62 [2023-11-21 22:03:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784434829] [2023-11-21 22:03:59,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:59,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-21 22:03:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-21 22:03:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2833, Unknown=117, NotChecked=690, Total=3906 [2023-11-21 22:03:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:59,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:59,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 4.032258064516129) internal successors, (250), 63 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:03:59,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:03:59,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:04:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:04:03,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:04:04,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:04:04,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:04:04,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:04:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash -500996372, now seen corresponding path program 1 times [2023-11-21 22:04:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:04:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126164091] [2023-11-21 22:04:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:04:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:04:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:04:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-21 22:04:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:04:04,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126164091] [2023-11-21 22:04:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126164091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:04:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:04:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:04:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922892516] [2023-11-21 22:04:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:04:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:04:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:04:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:04:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:04:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:04,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:04:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:04:04,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:04:04,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:04:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:04:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:04:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:04:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:04:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:04:04,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 22:04:04,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:04:04,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:04:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1986516461, now seen corresponding path program 1 times [2023-11-21 22:04:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:04:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115840089] [2023-11-21 22:04:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:04:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:04:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:04:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:04:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:04:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115840089] [2023-11-21 22:04:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115840089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:04:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851953578] [2023-11-21 22:04:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:04:06,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:04:06,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:04:06,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:04:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-21 22:04:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:04:07,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-21 22:04:07,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:04:07,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:04:07,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:04:07,347 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:04:07,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:04:07,687 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:04:07,687 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 88 treesize of output 78 [2023-11-21 22:04:07,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:07,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 22:04:07,906 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:04:07,907 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 64 treesize of output 52 [2023-11-21 22:04:07,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:07,917 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 20 treesize of output 15 [2023-11-21 22:04:07,937 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:04:08,003 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:04:08,097 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:04:08,206 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:04:08,657 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:04:08,762 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:08,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:08,771 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 27 treesize of output 13 [2023-11-21 22:04:08,849 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:08,853 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 27 treesize of output 13 [2023-11-21 22:04:08,939 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:08,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:08,947 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 27 treesize of output 13 [2023-11-21 22:04:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:09,021 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:04:09,289 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:09,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:09,293 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 27 treesize of output 13 [2023-11-21 22:04:09,391 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:09,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:09,396 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 27 treesize of output 13 [2023-11-21 22:04:09,499 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:09,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:09,503 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 27 treesize of output 13 [2023-11-21 22:04:09,588 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:04:09,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:04:09,598 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 27 treesize of output 13 [2023-11-21 22:04:09,720 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:04:09,721 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 79 treesize of output 71 [2023-11-21 22:04:10,061 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:04:10,061 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 70 treesize of output 43 [2023-11-21 22:04:10,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,130 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:04:10,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,146 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:04:10,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,160 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:04:10,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,176 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:04:10,225 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:04:10,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 43 treesize of output 32 [2023-11-21 22:04:10,248 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:04:10,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 43 treesize of output 32 [2023-11-21 22:04:10,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:04:10,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:10,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 22:04:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:04:10,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:04:15,631 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-21 22:04:15,773 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:04:15,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:04:16,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:04:16,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))))) is different from false [2023-11-21 22:04:16,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))))) is different from false [2023-11-21 22:04:16,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))))) is different from false [2023-11-21 22:04:16,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.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~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))))) is different from false [2023-11-21 22:04:16,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:04:16,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 22:04:16,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 22:04:17,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:04:17,336 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse10 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse8)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse10))))))) is different from false [2023-11-21 22:04:17,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:17,354 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 111 treesize of output 104 [2023-11-21 22:04:17,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:17,397 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 1209846 treesize of output 1111478 [2023-11-21 22:04:17,583 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 3456 treesize of output 3328 [2023-11-21 22:04:17,662 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 3472 treesize of output 3408 [2023-11-21 22:04:17,700 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 3984 treesize of output 3728 [2023-11-21 22:04:21,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:21,005 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 161 treesize of output 127 [2023-11-21 22:04:21,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:21,050 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 111 treesize of output 104 [2023-11-21 22:04:21,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:21,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:21,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:21,068 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 18106 treesize of output 16890 [2023-11-21 22:04:21,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1118 treesize of output 1054 [2023-11-21 22:04:21,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 499 treesize of output 491 [2023-11-21 22:04:21,148 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 563 treesize of output 547 [2023-11-21 22:04:21,662 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 265 treesize of output 207 [2023-11-21 22:04:21,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:21,712 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 111 treesize of output 104 [2023-11-21 22:04:21,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:21,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:21,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:21,729 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 19502 treesize of output 18030 [2023-11-21 22:04:21,753 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 1072 treesize of output 1008 [2023-11-21 22:04:21,765 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 485 treesize of output 477 [2023-11-21 22:04:21,781 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 547 treesize of output 531 [2023-11-21 22:04:22,441 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 192 treesize of output 146 [2023-11-21 22:04:22,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:22,493 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 109 treesize of output 102 [2023-11-21 22:04:22,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:22,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:04:22,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:22,508 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 4784 treesize of output 4436 [2023-11-21 22:04:22,567 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 1111 treesize of output 1079 [2023-11-21 22:04:22,584 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 563 treesize of output 559 [2023-11-21 22:04:22,600 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 598 treesize of output 590 [2023-11-21 22:04:22,808 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 215 treesize of output 177 [2023-11-21 22:04:25,012 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 887 treesize of output 875 [2023-11-21 22:04:28,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:28,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 99272 treesize of output 64087 [2023-11-21 22:04:30,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:30,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10069 treesize of output 10064 [2023-11-21 22:04:30,876 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 10055 treesize of output 10047 [2023-11-21 22:04:31,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:31,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10047 treesize of output 10030 [2023-11-21 22:04:31,361 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 10021 treesize of output 9991 [2023-11-21 22:04:31,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9991 treesize of output 9936 [2023-11-21 22:04:31,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:31,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9927 treesize of output 9904 [2023-11-21 22:04:32,145 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 9895 treesize of output 9893 [2023-11-21 22:04:32,401 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 9893 treesize of output 9891 [2023-11-21 22:04:32,651 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 9891 treesize of output 9883 [2023-11-21 22:04:32,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:32,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9883 treesize of output 9880 [2023-11-21 22:04:33,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:33,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9871 treesize of output 9858 [2023-11-21 22:04:33,436 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 9849 treesize of output 9733 [2023-11-21 22:04:33,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9733 treesize of output 9528 [2023-11-21 22:04:34,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:34,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9519 treesize of output 9108 [2023-11-21 22:04:34,307 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 9099 treesize of output 9093 [2023-11-21 22:04:34,605 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 9093 treesize of output 9081 [2023-11-21 22:04:34,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 9081 treesize of output 9075 [2023-11-21 22:04:35,096 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 9075 treesize of output 8877 [2023-11-21 22:04:35,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:35,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8877 treesize of output 8412 [2023-11-21 22:04:35,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:35,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8403 treesize of output 8212 [2023-11-21 22:04:35,915 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 8203 treesize of output 8173 [2023-11-21 22:04:36,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:36,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8173 treesize of output 8094 [2023-11-21 22:04:36,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:04:36,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8085 treesize of output 8050 [2023-11-21 22:05:06,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:06,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 933 treesize of output 1068 [2023-11-21 22:05:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 22:05:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851953578] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:07,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:07,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 31] total 83 [2023-11-21 22:05:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931691051] [2023-11-21 22:05:07,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:07,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-21 22:05:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-21 22:05:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=4651, Unknown=28, NotChecked=1950, Total=6972 [2023-11-21 22:05:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:07,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:07,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 3.3734939759036147) internal successors, (280), 84 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:05:07,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:07,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:05:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-21 22:05:33,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:05:33,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:33,984 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:33,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1081034471, now seen corresponding path program 2 times [2023-11-21 22:05:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364408109] [2023-11-21 22:05:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364408109] [2023-11-21 22:05:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364408109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471135593] [2023-11-21 22:05:36,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:05:36,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:36,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:36,135 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-21 22:05:36,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:05:36,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:36,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-21 22:05:36,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:36,793 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:36,794 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:05:36,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:36,802 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:05:37,103 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:37,104 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:05:37,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,114 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 20 treesize of output 15 [2023-11-21 22:05:37,141 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:05:37,219 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:05:37,299 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:05:37,718 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:05:37,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:37,726 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:05:37,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,807 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:05:37,823 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:05:37,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,908 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:05:37,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,932 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:05:37,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,951 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:05:38,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,033 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:05:38,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,054 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:05:38,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,099 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:05:38,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,367 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:05:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,383 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:05:38,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,402 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:05:38,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,424 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:05:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,546 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:05:38,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,560 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:05:38,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:38,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,594 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:05:38,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:38,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 22:05:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:38,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:42,377 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:05:42,525 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 22:05:42,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))))) is different from false [2023-11-21 22:05:43,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 22:05:43,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:05:43,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:05:43,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 22:05:43,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-21 22:05:43,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse6)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-21 22:05:43,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse8)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:05:43,528 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:05:43,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 15414 treesize of output 13208 [2023-11-21 22:05:43,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:43,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1122 treesize of output 1024 [2023-11-21 22:05:43,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 452 [2023-11-21 22:05:43,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 820 treesize of output 788 [2023-11-21 22:05:43,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 868 [2023-11-21 22:05:44,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,104 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:05:44,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1202 treesize of output 1 [2023-11-21 22:05:44,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,116 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:05:44,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1266 treesize of output 1 [2023-11-21 22:05:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,135 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 22:05:44,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 770 treesize of output 745 [2023-11-21 22:05:44,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:44,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 148 [2023-11-21 22:05:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:44,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2023-11-21 22:05:44,785 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 73 treesize of output 65 [2023-11-21 22:05:44,791 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:05:47,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:47,212 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 54 treesize of output 67 [2023-11-21 22:05:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 22:05:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471135593] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:47,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 73 [2023-11-21 22:05:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2474164] [2023-11-21 22:05:47,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:47,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-21 22:05:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-21 22:05:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3810, Unknown=14, NotChecked=1330, Total=5402 [2023-11-21 22:05:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:47,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:47,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.8493150684931505) internal successors, (281), 74 states have internal predecessors, (281), 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:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 22:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:47,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:47,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 22:05:47,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:05:47,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:47,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-21 22:05:47,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-21 22:06:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-11-21 22:06:02,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 22:06:02,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:02,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 605097109, now seen corresponding path program 2 times [2023-11-21 22:06:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661361626] [2023-11-21 22:06:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661361626] [2023-11-21 22:06:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661361626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763217259] [2023-11-21 22:06:04,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:06:04,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:04,800 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:04,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-21 22:06:05,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:06:05,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:05,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-21 22:06:05,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:05,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:06:05,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:06:05,244 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:05,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:06:05,847 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:06:05,847 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 71 treesize of output 57 [2023-11-21 22:06:05,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,851 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:06:06,105 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-21 22:06:06,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 22:06:06,120 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:06:06,121 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 64 treesize of output 52 [2023-11-21 22:06:06,197 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:06:06,267 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:06:06,350 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:06:06,743 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:06:06,846 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:06,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2023-11-21 22:06:06,850 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 20 treesize of output 10 [2023-11-21 22:06:06,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:06,925 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 39 treesize of output 44 [2023-11-21 22:06:07,036 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,046 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 27 treesize of output 13 [2023-11-21 22:06:07,128 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,137 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 27 treesize of output 13 [2023-11-21 22:06:07,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:07,210 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:06:07,554 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,558 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 27 treesize of output 13 [2023-11-21 22:06:07,663 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,667 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 27 treesize of output 13 [2023-11-21 22:06:07,747 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,757 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 27 treesize of output 13 [2023-11-21 22:06:07,851 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:06:07,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-21 22:06:07,864 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 27 treesize of output 13 [2023-11-21 22:06:07,994 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:06:07,994 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 78 treesize of output 62 [2023-11-21 22:06:08,410 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:06:08,411 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 70 treesize of output 43 [2023-11-21 22:06:08,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:06:08,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:06:08,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:06:08,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:06:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:06:08,679 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:06:08,692 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:06:08,711 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:06:08,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:08,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 22:06:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:09,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:10,208 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 22:06:10,293 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 22:06:10,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 22:06:10,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:06:10,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))))) is different from false [2023-11-21 22:06:10,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))))) is different from false [2023-11-21 22:06:10,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))))) is different from false [2023-11-21 22:06:10,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse7)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))))) is different from false [2023-11-21 22:06:10,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse4 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))))) is different from false [2023-11-21 22:06:11,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-21 22:06:11,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))))) is different from false [2023-11-21 22:06:11,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse2 .cse3 (store (select .cse2 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse3 (store (select .cse5 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse3 (store (select .cse6 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse3 (store (select .cse7 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))))) is different from false [2023-11-21 22:06:11,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse9 .cse1 (store (select .cse9 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5)))))) is different from false [2023-11-21 22:06:11,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse10)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6)))))) is different from false [2023-11-21 22:06:11,666 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:06:11,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5031032 treesize of output 4465834 [2023-11-21 22:06:11,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:11,962 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 4364 treesize of output 4010 [2023-11-21 22:06:12,030 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 3812 treesize of output 3684 [2023-11-21 22:06:12,065 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 2026 treesize of output 2010 [2023-11-21 22:06:12,099 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 4280 treesize of output 4024 [2023-11-21 22:06:12,140 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 4168 treesize of output 4104 [2023-11-21 22:06:16,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:16,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:16,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:16,587 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:06:16,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36344 treesize of output 31018 [2023-11-21 22:06:16,627 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 658 treesize of output 650 [2023-11-21 22:06:16,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:16,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:16,647 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 1134 treesize of output 1072 [2023-11-21 22:06:16,667 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 560 treesize of output 544 [2023-11-21 22:06:16,680 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 1130 treesize of output 1066 [2023-11-21 22:06:17,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:17,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:17,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:17,751 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:06:17,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 3 new quantified variables, introduced 4 case distinctions, treesize of input 34296 treesize of output 28970 [2023-11-21 22:06:17,788 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 650 treesize of output 642 [2023-11-21 22:06:17,803 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 674 treesize of output 670 [2023-11-21 22:06:17,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:17,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:17,823 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 1250 treesize of output 1148 [2023-11-21 22:06:17,838 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 1206 treesize of output 1174 [2023-11-21 22:06:18,207 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:18,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:18,244 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:06:18,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28408 treesize of output 27690 [2023-11-21 22:06:18,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:18,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:18,283 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 1014 treesize of output 956 [2023-11-21 22:06:18,296 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 532 treesize of output 516 [2023-11-21 22:06:18,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 544 [2023-11-21 22:06:18,325 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 1130 treesize of output 1066 Killed by 15