./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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.5-?-c7c6ca5-m [2024-11-13 06:39:05,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:39:06,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:39:06,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:39:06,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:39:06,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:39:06,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:39:06,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:39:06,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:39:06,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:39:06,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:39:06,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:39:06,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:39:06,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:39:06,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:39:06,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:39:06,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:39:06,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:39:06,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:39:06,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:39:06,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:39:06,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:39:06,068 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:39:06,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:39:06,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:39:06,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:39:06,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:39:06,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:39:06,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:39:06,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:39:06,071 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:39:06,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:39:06,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:39:06,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:39:06,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:39:06,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:39:06,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:39:06,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:39:06,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:39:06,073 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:39:06,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:39:06,075 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:39:06,075 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:39:06,075 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 [2024-11-13 06:39:06,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:39:06,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:39:06,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:39:06,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:39:06,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:39:06,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-11-13 06:39:07,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:39:08,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:39:08,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-11-13 06:39:08,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdc7380f5/eba984d36b4e4e26adc8e4da79b8dcf2/FLAGe1fad2fbc [2024-11-13 06:39:08,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdc7380f5/eba984d36b4e4e26adc8e4da79b8dcf2 [2024-11-13 06:39:08,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:39:08,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:39:08,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:39:08,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:39:08,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:39:08,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:39:08" (1/1) ... [2024-11-13 06:39:08,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c95441d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:08, skipping insertion in model container [2024-11-13 06:39:08,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:39:08" (1/1) ... [2024-11-13 06:39:08,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:39:08,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:39:08,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:39:08,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:39:09,041 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:39:09,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09 WrapperNode [2024-11-13 06:39:09,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:39:09,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:39:09,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:39:09,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:39:09,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,091 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-13 06:39:09,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:39:09,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:39:09,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:39:09,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:39:09,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:39:09,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:39:09,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:39:09,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:39:09,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (1/1) ... [2024-11-13 06:39:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:39:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:09,171 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) [2024-11-13 06:39:09,173 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 [2024-11-13 06:39:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:39:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:39:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:39:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:39:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 06:39:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 06:39:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:39:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:39:09,217 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:39:09,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:39:09,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:39:09,456 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:39:09,456 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:39:09,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:39:09,478 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 06:39:09,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:39:09 BoogieIcfgContainer [2024-11-13 06:39:09,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:39:09,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:39:09,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:39:09,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:39:09,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:39:08" (1/3) ... [2024-11-13 06:39:09,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22900173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:39:09, skipping insertion in model container [2024-11-13 06:39:09,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:09" (2/3) ... [2024-11-13 06:39:09,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22900173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:39:09, skipping insertion in model container [2024-11-13 06:39:09,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:39:09" (3/3) ... [2024-11-13 06:39:09,488 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2024-11-13 06:39:09,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:39:09,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-13 06:39:09,502 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:39:09,546 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 06:39:09,593 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:39:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:09,595 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) [2024-11-13 06:39:09,597 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 [2024-11-13 06:39:09,621 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:39:09,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-11-13 06:39:09,634 INFO L333 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, 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;@59ed6dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:09,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 06:39:09,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:09,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 670831057, now seen corresponding path program 1 times [2024-11-13 06:39:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094997923] [2024-11-13 06:39:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:10,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094997923] [2024-11-13 06:39:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094997923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:39:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077465365] [2024-11-13 06:39:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:39:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:39:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:39:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:10,201 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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) [2024-11-13 06:39:10,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 06:39:10,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1712778762, now seen corresponding path program 1 times [2024-11-13 06:39:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95479950] [2024-11-13 06:39:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95479950] [2024-11-13 06:39:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95479950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:39:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256981859] [2024-11-13 06:39:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:10,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:39:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:39:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:39:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:10,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:10,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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) [2024-11-13 06:39:10,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:10,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:11,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 06:39:11,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1151871505, now seen corresponding path program 1 times [2024-11-13 06:39:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027100183] [2024-11-13 06:39:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027100183] [2024-11-13 06:39:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027100183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376975166] [2024-11-13 06:39:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:11,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:11,618 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) [2024-11-13 06:39:11,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 06:39:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:11,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 06:39:11,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:11,763 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 [2024-11-13 06:39:11,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:11,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:39:11,841 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 [2024-11-13 06:39:11,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:11,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:11,868 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 [2024-11-13 06:39:11,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:11,889 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 [2024-11-13 06:39:12,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:12,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:14,152 WARN L851 $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_111 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:39:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376975166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:18,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 06:39:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487205238] [2024-11-13 06:39:18,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:18,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 06:39:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 06:39:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=240, Unknown=18, NotChecked=32, Total=342 [2024-11-13 06:39:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:18,294 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:18,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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) [2024-11-13 06:39:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:18,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:39:20,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-13 06:39:20,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 06:39:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 06:39:20,785 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 06:39:20,787 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-11-13 06:39:20,790 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:20,791 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:39:20,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:39:20,792 INFO L333 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, 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;@59ed6dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:20,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 06:39:20,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:39:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1088365276, now seen corresponding path program 1 times [2024-11-13 06:39:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853146548] [2024-11-13 06:39:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853146548] [2024-11-13 06:39:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853146548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:20,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:39:20,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470399735] [2024-11-13 06:39:20,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:20,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:39:20,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:39:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:39:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,814 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:20,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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) [2024-11-13 06:39:20,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 06:39:20,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:39:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2102882945, now seen corresponding path program 1 times [2024-11-13 06:39:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220358007] [2024-11-13 06:39:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:20,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220358007] [2024-11-13 06:39:20,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220358007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:20,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:20,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:39:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612246305] [2024-11-13 06:39:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:20,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:39:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:20,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:39:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:39:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,988 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:20,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) [2024-11-13 06:39:20,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:20,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:21,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 06:39:21,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:39:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1182255393, now seen corresponding path program 1 times [2024-11-13 06:39:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463850499] [2024-11-13 06:39:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:39:21,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:39:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:39:21,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:39:21,158 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:39:21,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-13 06:39:21,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2024-11-13 06:39:21,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2024-11-13 06:39:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 06:39:21,165 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 06:39:21,166 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-11-13 06:39:21,167 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:39:21,167 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 06:39:21,179 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 06:39:21,183 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:21,185 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:39:21,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-11-13 06:39:21,186 INFO L333 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, 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;@59ed6dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:39:21,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 06:39:21,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:21,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1689356545, now seen corresponding path program 1 times [2024-11-13 06:39:21,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:21,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168941993] [2024-11-13 06:39:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168941993] [2024-11-13 06:39:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168941993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:21,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:39:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286657816] [2024-11-13 06:39:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:39:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:39:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:39:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,402 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:21,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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) [2024-11-13 06:39:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 06:39:21,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2119892373, now seen corresponding path program 1 times [2024-11-13 06:39:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132540218] [2024-11-13 06:39:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132540218] [2024-11-13 06:39:21,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132540218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:21,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:21,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:39:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39249125] [2024-11-13 06:39:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:21,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:39:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:21,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:39:21,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:39:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,623 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:21,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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) [2024-11-13 06:39:21,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:21,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:39:22,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:22,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1740840336, now seen corresponding path program 1 times [2024-11-13 06:39:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079649744] [2024-11-13 06:39:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079649744] [2024-11-13 06:39:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079649744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780776575] [2024-11-13 06:39:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:23,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:23,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:23,117 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) [2024-11-13 06:39:23,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 06:39:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:23,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 06:39:23,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:23,198 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 [2024-11-13 06:39:23,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:23,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:39:23,250 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 [2024-11-13 06:39:23,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:39:23,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:23,266 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 [2024-11-13 06:39:23,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:23,278 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 [2024-11-13 06:39:23,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:23,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:23,414 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2024-11-13 06:39:23,511 WARN L851 $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_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2024-11-13 06:39:23,528 WARN L851 $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_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_276 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_276) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:39:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:39:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780776575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:25,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 06:39:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828016389] [2024-11-13 06:39:25,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 06:39:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 06:39:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2024-11-13 06:39:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:25,586 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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) [2024-11-13 06:39:25,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:25,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:25,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:39:27,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 06:39:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:27,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2106845731, now seen corresponding path program 1 times [2024-11-13 06:39:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509875315] [2024-11-13 06:39:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 06:39:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509875315] [2024-11-13 06:39:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509875315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:39:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:39:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 06:39:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231822801] [2024-11-13 06:39:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:39:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:39:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:39:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:39:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:27,811 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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) [2024-11-13 06:39:27,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:27,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:27,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:39:27,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:39:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 06:39:29,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -823202217, now seen corresponding path program 1 times [2024-11-13 06:39:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268500667] [2024-11-13 06:39:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:30,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268500667] [2024-11-13 06:39:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268500667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:30,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548847743] [2024-11-13 06:39:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:30,200 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) [2024-11-13 06:39:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 06:39:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:30,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 06:39:30,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:30,294 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 [2024-11-13 06:39:30,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:30,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:39:30,410 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 [2024-11-13 06:39:30,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:30,483 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 [2024-11-13 06:39:30,529 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 [2024-11-13 06:39:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:30,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:39:30,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:30,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:31,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:31,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 [2024-11-13 06:39:31,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:39:31,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:31,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:31,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:31,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:31,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:31,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:31,182 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 [2024-11-13 06:39:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:31,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:31,739 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 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_436))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2024-11-13 06:39:32,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2024-11-13 06:39:32,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))))) is different from false [2024-11-13 06:39:32,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))))) is different from false [2024-11-13 06:39:32,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3)))))) is different from false [2024-11-13 06:39:32,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse6 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse7 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3)))))) is different from false [2024-11-13 06:39:32,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse6 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_436 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_437 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_436))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_437))) c_threadThread1of2ForFork0_~p~0.base) .cse8)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2)))))) is different from false [2024-11-13 06:39:32,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:32,714 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 69 treesize of output 62 [2024-11-13 06:39:32,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:32,724 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 316 treesize of output 274 [2024-11-13 06:39:32,736 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 157 treesize of output 141 [2024-11-13 06:39:32,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:32,817 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 81 treesize of output 55 [2024-11-13 06:39:32,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:32,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62 [2024-11-13 06:39:32,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:32,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:32,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118 [2024-11-13 06:39:32,862 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 40 treesize of output 36 [2024-11-13 06:39:32,867 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 112 treesize of output 70 [2024-11-13 06:39:32,888 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:39:32,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 1 [2024-11-13 06:39:32,894 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:39:32,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 1 [2024-11-13 06:39:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 06:39:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548847743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:33,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 44 [2024-11-13 06:39:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484869569] [2024-11-13 06:39:33,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:33,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 06:39:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 06:39:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1235, Unknown=7, NotChecked=546, Total=1980 [2024-11-13 06:39:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:33,047 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:33,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.977272727272727) internal successors, (175), 45 states have internal predecessors, (175), 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) [2024-11-13 06:39:33,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:33,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:33,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:39:33,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:33,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 06:39:38,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 06:39:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:38,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1312260077, now seen corresponding path program 2 times [2024-11-13 06:39:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052054929] [2024-11-13 06:39:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052054929] [2024-11-13 06:39:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052054929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765825272] [2024-11-13 06:39:40,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:39:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:40,088 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) [2024-11-13 06:39:40,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 06:39:40,174 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:39:40,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:39:40,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 06:39:40,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:40,182 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 [2024-11-13 06:39:40,207 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:40,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:39:40,446 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 [2024-11-13 06:39:40,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:39:40,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:39:40,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 30 treesize of output 21 [2024-11-13 06:39:40,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:39:40,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:40,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:40,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:41,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:41,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:41,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 37 treesize of output 26 [2024-11-13 06:39:41,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:39:41,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:41,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:41,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:41,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-11-13 06:39:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:41,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:42,078 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2024-11-13 06:39:42,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse1))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse1))))) is different from false [2024-11-13 06:39:42,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2)))))) is different from false [2024-11-13 06:39:42,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2024-11-13 06:39:42,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))))) is different from false [2024-11-13 06:39:42,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 06:39:43,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2024-11-13 06:39:43,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_551 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_541) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_550))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 v_ArrVal_551))) c_threadThread1of2ForFork0_~p~0.base) .cse8))))))) is different from false [2024-11-13 06:39:43,210 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 06:39:43,210 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 822 treesize of output 636 [2024-11-13 06:39:43,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 236 [2024-11-13 06:39:43,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:43,233 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 384 treesize of output 338 [2024-11-13 06:39:43,243 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 129 treesize of output 127 [2024-11-13 06:39:43,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:43,396 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 06:39:43,398 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 136 treesize of output 139 [2024-11-13 06:39:43,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:43,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2024-11-13 06:39:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:43,428 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:43,435 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 06:39:43,436 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 260 treesize of output 1 [2024-11-13 06:39:43,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:43,446 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 06:39:43,446 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 260 treesize of output 1 [2024-11-13 06:39:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 06:39:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765825272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:43,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2024-11-13 06:39:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701202960] [2024-11-13 06:39:43,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 06:39:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 06:39:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1945, Unknown=8, NotChecked=776, Total=2970 [2024-11-13 06:39:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:43,643 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 4.074074074074074) internal successors, (220), 55 states have internal predecessors, (220), 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) [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 06:39:43,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 06:39:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 06:39:47,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 06:39:47,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 06:39:47,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1282018905, now seen corresponding path program 2 times [2024-11-13 06:39:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275135079] [2024-11-13 06:39:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:39:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275135079] [2024-11-13 06:39:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275135079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426260683] [2024-11-13 06:39:48,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:39:48,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:48,065 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) [2024-11-13 06:39:48,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 06:39:48,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:39:48,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:39:48,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 06:39:48,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:48,171 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 [2024-11-13 06:39:48,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:48,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 11 treesize of output 11 [2024-11-13 06:39:48,370 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 15 treesize of output 11 [2024-11-13 06:39:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 06:39:48,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-13 06:39:48,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:48,440 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 40 treesize of output 42 [2024-11-13 06:39:48,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:48,484 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 52 treesize of output 57 [2024-11-13 06:39:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:48,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:48,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_652 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_652) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))))) is different from false [2024-11-13 06:39:48,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 06:39:48,606 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 18 [2024-11-13 06:39:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:39:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426260683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:48,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 29 [2024-11-13 06:39:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932363827] [2024-11-13 06:39:48,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:48,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:39:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:39:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2024-11-13 06:39:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:48,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 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) [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 06:39:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:39:49,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 06:39:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 06:39:49,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:49,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1496176467, now seen corresponding path program 3 times [2024-11-13 06:39:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259750366] [2024-11-13 06:39:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259750366] [2024-11-13 06:39:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259750366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274515703] [2024-11-13 06:39:50,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:39:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:50,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:50,620 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) [2024-11-13 06:39:50,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 06:39:50,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:39:50,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:39:50,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 06:39:50,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:50,754 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 [2024-11-13 06:39:50,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:50,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:39:51,006 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 [2024-11-13 06:39:51,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:39:51,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:39:51,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:39:51,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:39:51,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:39:51,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:39:51,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:39:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:39:51,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:39:51,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:39:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:51,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:51,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:51,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:51,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:51,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:51,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-11-13 06:39:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:51,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:39:52,527 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-11-13 06:39:52,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|)))))) is different from false [2024-11-13 06:39:52,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2024-11-13 06:39:53,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 06:39:53,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))))) is different from false [2024-11-13 06:39:53,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))))) is different from false [2024-11-13 06:39:53,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse7)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3)))))) is different from false [2024-11-13 06:39:53,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse4))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_768 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (v_ArrVal_769 Int) (v_ArrVal_763 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_763) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_768))) (store .cse8 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 v_ArrVal_769))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 06:39:53,772 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 06:39:53,772 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 886 treesize of output 700 [2024-11-13 06:39:53,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:39:53,789 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 352 treesize of output 318 [2024-11-13 06:39:53,799 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 96 treesize of output 92 [2024-11-13 06:39:53,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 181 [2024-11-13 06:39:53,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:53,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:53,964 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 06:39:53,964 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 282 treesize of output 265 [2024-11-13 06:39:53,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-13 06:39:53,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:53,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:39:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2024-11-13 06:39:54,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:54,011 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 06:39:54,011 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 530 treesize of output 1 [2024-11-13 06:39:54,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:39:54,022 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 06:39:54,022 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 498 treesize of output 1 [2024-11-13 06:39:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 06:39:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274515703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:39:54,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:39:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2024-11-13 06:39:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339672055] [2024-11-13 06:39:54,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:39:54,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 06:39:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:39:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 06:39:54,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1953, Unknown=8, NotChecked=776, Total=2970 [2024-11-13 06:39:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:54,202 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:39:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 4.074074074074074) internal successors, (220), 55 states have internal predecessors, (220), 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) [2024-11-13 06:39:54,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:54,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:54,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:54,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:54,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 06:39:54,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 06:39:54,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:39:54,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:39:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 06:39:58,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 06:39:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 06:39:58,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:39:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:39:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1813714001, now seen corresponding path program 4 times [2024-11-13 06:39:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:39:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753237939] [2024-11-13 06:39:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:39:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:39:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:39:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:39:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:39:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753237939] [2024-11-13 06:39:59,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753237939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:39:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404048125] [2024-11-13 06:39:59,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 06:39:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:39:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:39:59,140 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) [2024-11-13 06:39:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 06:39:59,396 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 06:39:59,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:39:59,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 06:39:59,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:39:59,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:39:59,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2024-11-13 06:39:59,703 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 [2024-11-13 06:39:59,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,961 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 49 treesize of output 35 [2024-11-13 06:39:59,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:39:59,981 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 42 treesize of output 47 [2024-11-13 06:40:00,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,052 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 3 case distinctions, treesize of input 63 treesize of output 50 [2024-11-13 06:40:00,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,073 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 3 case distinctions, treesize of input 51 treesize of output 59 [2024-11-13 06:40:00,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 62 [2024-11-13 06:40:00,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 74 [2024-11-13 06:40:00,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 84 treesize of output 77 [2024-11-13 06:40:00,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:00,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:40:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 72 treesize of output 86 [2024-11-13 06:40:15,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:40:15,381 INFO L349 Elim1Store]: treesize reduction 120, result has 45.7 percent of original size [2024-11-13 06:40:15,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 83 treesize of output 141 [2024-11-13 06:40:54,441 INFO L349 Elim1Store]: treesize reduction 552, result has 51.9 percent of original size [2024-11-13 06:40:54,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 63 case distinctions, treesize of input 162 treesize of output 689 [2024-11-13 06:46:48,836 WARN L286 SmtUtils]: Spent 1.71m on a formula simplification. DAG size of input: 4068 DAG size of output: 4303 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 06:49:39,950 WARN L286 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 4730 DAG size of output: 4730 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15