./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 05:12:27,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 05:12:27,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 05:12:27,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 05:12:27,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 05:12:27,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 05:12:27,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 05:12:27,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 05:12:27,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 05:12:27,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 05:12:27,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 05:12:27,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 05:12:27,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 05:12:27,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 05:12:27,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 05:12:27,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 05:12:27,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 05:12:27,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 05:12:27,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 05:12:27,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 05:12:27,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 05:12:27,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 05:12:27,435 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 05:12:27,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 05:12:27,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 05:12:27,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 05:12:27,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 05:12:27,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 05:12:27,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 05:12:27,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 05:12:27,438 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 05:12:27,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 05:12:27,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 05:12:27,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 05:12:27,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 05:12:27,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 05:12:27,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 05:12:27,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 05:12:27,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 05:12:27,440 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 05:12:27,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 05:12:27,441 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 05:12:27,441 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 05:12:27,441 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2024-10-26 05:12:27,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 05:12:27,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 05:12:27,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 05:12:27,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 05:12:27,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 05:12:27,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-26 05:12:29,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 05:12:29,462 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 05:12:29,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-26 05:12:29,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c0bdbeb1/da73885ab7a346be94c0d8f44ab667cd/FLAG6d466f08b [2024-10-26 05:12:29,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c0bdbeb1/da73885ab7a346be94c0d8f44ab667cd [2024-10-26 05:12:29,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 05:12:29,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 05:12:29,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 05:12:29,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 05:12:29,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 05:12:29,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:12:29" (1/1) ... [2024-10-26 05:12:29,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c07773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:29, skipping insertion in model container [2024-10-26 05:12:29,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:12:29" (1/1) ... [2024-10-26 05:12:29,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 05:12:29,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 05:12:29,956 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 05:12:30,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 05:12:30,060 INFO L204 MainTranslator]: Completed translation [2024-10-26 05:12:30,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30 WrapperNode [2024-10-26 05:12:30,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 05:12:30,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 05:12:30,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 05:12:30,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 05:12:30,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,111 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-26 05:12:30,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 05:12:30,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 05:12:30,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 05:12:30,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 05:12:30,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 05:12:30,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 05:12:30,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 05:12:30,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 05:12:30,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (1/1) ... [2024-10-26 05:12:30,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 05:12:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:12:30,182 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-10-26 05:12:30,187 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-10-26 05:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 05:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 05:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 05:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 05:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 05:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 05:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-26 05:12:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-26 05:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 05:12:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 05:12:30,239 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 05:12:30,454 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 05:12:30,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 05:12:30,737 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 05:12:30,738 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 05:12:30,754 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 05:12:30,754 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-26 05:12:30,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:12:30 BoogieIcfgContainer [2024-10-26 05:12:30,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 05:12:30,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 05:12:30,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 05:12:30,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 05:12:30,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 05:12:29" (1/3) ... [2024-10-26 05:12:30,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889a64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 05:12:30, skipping insertion in model container [2024-10-26 05:12:30,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:12:30" (2/3) ... [2024-10-26 05:12:30,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889a64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 05:12:30, skipping insertion in model container [2024-10-26 05:12:30,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:12:30" (3/3) ... [2024-10-26 05:12:30,763 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2024-10-26 05:12:30,779 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 05:12:30,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-26 05:12:30,780 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 05:12:30,845 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 05:12:30,889 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:12:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:12:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:12:30,892 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-10-26 05:12:30,893 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-10-26 05:12:30,930 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:12:30,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-10-26 05:12:30,951 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;@55b014cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:12:30,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-26 05:12:31,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:12:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:12:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2027741325, now seen corresponding path program 1 times [2024-10-26 05:12:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:12:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14459480] [2024-10-26 05:12:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:12:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:12:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14459480] [2024-10-26 05:12:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14459480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:12:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:12:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:12:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277791257] [2024-10-26 05:12:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:12:31,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:12:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:12:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:12:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:12:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:31,689 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:12:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:12:31,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:31,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 05:12:31,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:12:31,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:12:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash -624886610, now seen corresponding path program 1 times [2024-10-26 05:12:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:12:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789529519] [2024-10-26 05:12:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:12:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:12:32,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789529519] [2024-10-26 05:12:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789529519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:12:32,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:12:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:12:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113666019] [2024-10-26 05:12:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:12:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:12:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:12:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:12:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:12:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:32,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:12:32,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:12:32,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:32,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:12:33,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 05:12:33,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:12:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:12:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 4549639, now seen corresponding path program 1 times [2024-10-26 05:12:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:12:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718101850] [2024-10-26 05:12:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:12:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:12:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718101850] [2024-10-26 05:12:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718101850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:12:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321206059] [2024-10-26 05:12:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:12:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:12:33,795 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-10-26 05:12:33,797 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-10-26 05:12:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:33,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-26 05:12:33,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:12:33,954 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-10-26 05:12:34,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:12:34,006 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-10-26 05:12:34,071 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 13 treesize of output 9 [2024-10-26 05:12:34,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:12:34,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:34,109 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 32 treesize of output 34 [2024-10-26 05:12:34,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:34,128 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 41 treesize of output 46 [2024-10-26 05:12:34,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:34,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:12:34,388 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:12:34,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:12:34,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:12:34,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_212) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:12:34,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:34,742 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 37 treesize of output 53 [2024-10-26 05:12:34,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:34,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:12:34,771 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:12:34,771 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:12:34,779 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:12:34,779 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:12:34,787 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:12:34,788 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:12:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-26 05:12:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321206059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:12:34,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:12:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-10-26 05:12:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103105587] [2024-10-26 05:12:34,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:12:34,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 05:12:34,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:12:34,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 05:12:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2024-10-26 05:12:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:34,855 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:12:34,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 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-10-26 05:12:34,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:34,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:12:34,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:12:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:12:36,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-26 05:12:36,571 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-10-26 05:12:36,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:12:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:12:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2128777054, now seen corresponding path program 2 times [2024-10-26 05:12:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:12:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40124174] [2024-10-26 05:12:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:12:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:12:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40124174] [2024-10-26 05:12:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40124174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:12:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194645950] [2024-10-26 05:12:37,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:12:37,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:12:37,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:12:37,555 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-10-26 05:12:37,556 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-10-26 05:12:37,674 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:12:37,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:12:37,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-26 05:12:37,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:12:37,691 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-10-26 05:12:37,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:12:37,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:12:38,004 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 13 treesize of output 9 [2024-10-26 05:12:38,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:12:38,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:38,101 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 32 treesize of output 34 [2024-10-26 05:12:38,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:38,181 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 41 treesize of output 46 [2024-10-26 05:12:38,416 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:12:38,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-26 05:12:38,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:38,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:38,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:12:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:38,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:12:38,739 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_365 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_365 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_365 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:12:38,812 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:12:38,897 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_365) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:12:43,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,836 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 40 treesize of output 56 [2024-10-26 05:12:43,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 66 [2024-10-26 05:12:43,849 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 46 treesize of output 38 [2024-10-26 05:12:43,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-26 05:12:43,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,888 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 40 treesize of output 56 [2024-10-26 05:12:43,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:12:43,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:12:43,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,919 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 40 treesize of output 56 [2024-10-26 05:12:43,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:12:43,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:12:43,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,945 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 40 treesize of output 56 [2024-10-26 05:12:43,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:12:43,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:12:43,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:12:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-10-26 05:12:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194645950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:12:50,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:12:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2024-10-26 05:12:50,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903779522] [2024-10-26 05:12:50,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:12:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-26 05:12:50,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:12:50,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-26 05:12:50,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1419, Unknown=26, NotChecked=240, Total=1892 [2024-10-26 05:12:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:50,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:12:50,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 4.395348837209302) internal successors, (189), 44 states have internal predecessors, (189), 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-10-26 05:12:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:12:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:12:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:12:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:12:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:12:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:12:52,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-26 05:12:52,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:12:52,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:12:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:12:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -130889812, now seen corresponding path program 1 times [2024-10-26 05:12:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:12:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747330843] [2024-10-26 05:12:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:12:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:12:55,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747330843] [2024-10-26 05:12:55,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747330843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:12:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532544639] [2024-10-26 05:12:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:12:55,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:12:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:12:55,019 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-10-26 05:12:55,030 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-10-26 05:12:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:12:55,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-26 05:12:55,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:12:55,158 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-10-26 05:12:55,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:12:55,258 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-10-26 05:12:55,335 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 1 [2024-10-26 05:12:55,339 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-10-26 05:12:55,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:12:55,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:12:55,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 05:12:55,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-26 05:12:55,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-26 05:12:55,717 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-26 05:12:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-26 05:12:55,772 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 13 treesize of output 9 [2024-10-26 05:12:55,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:12:55,890 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 32 treesize of output 34 [2024-10-26 05:12:55,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 41 treesize of output 46 [2024-10-26 05:12:56,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:12:56,370 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 23 treesize of output 11 [2024-10-26 05:12:56,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-10-26 05:12:56,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-10-26 05:12:56,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2024-10-26 05:12:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-10-26 05:12:56,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:12:56,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:12:56,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:12:56,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:12:56,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2024-10-26 05:12:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:12:56,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:13:59,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:13:59,844 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 59 treesize of output 60 [2024-10-26 05:13:59,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:13:59,858 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 47 treesize of output 48 [2024-10-26 05:13:59,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:13:59,875 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 60 treesize of output 56 [2024-10-26 05:13:59,882 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 42 [2024-10-26 05:13:59,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:13:59,893 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 68 treesize of output 64 [2024-10-26 05:13:59,899 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 51 treesize of output 49 [2024-10-26 05:14:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532544639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:14:01,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:14:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 22] total 58 [2024-10-26 05:14:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701313799] [2024-10-26 05:14:01,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:14:01,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-26 05:14:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:14:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-26 05:14:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3097, Unknown=19, NotChecked=0, Total=3422 [2024-10-26 05:14:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:01,200 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:14:01,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.1379310344827585) internal successors, (182), 59 states have internal predecessors, (182), 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-10-26 05:14:01,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:01,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:01,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:14:01,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:14:01,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:14:14,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-26 05:14:14,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:14:14,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:14:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:14:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash -71172084, now seen corresponding path program 3 times [2024-10-26 05:14:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:14:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730875536] [2024-10-26 05:14:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:14:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:14:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:14:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:14:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730875536] [2024-10-26 05:14:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730875536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:14:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801449009] [2024-10-26 05:14:15,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 05:14:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:14:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:14:15,578 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-10-26 05:14:15,579 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-10-26 05:14:15,685 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-26 05:14:15,685 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:14:15,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-26 05:14:15,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:14:15,695 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-10-26 05:14:15,742 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:14:15,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:14:15,952 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 13 treesize of output 9 [2024-10-26 05:14:15,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:14:16,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:16,035 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 32 treesize of output 34 [2024-10-26 05:14:16,233 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:14:16,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-26 05:14:16,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-26 05:14:16,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:16,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 05:14:16,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:16,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:16,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:16,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 45 treesize of output 34 [2024-10-26 05:14:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:16,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:14:16,557 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_654 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:14:16,629 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:14:16,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))) is different from false [2024-10-26 05:14:16,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:14:16,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_649) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_654) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:14:18,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 05:14:18,764 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 28 treesize of output 20 [2024-10-26 05:14:18,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:18,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2024-10-26 05:14:18,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 45 [2024-10-26 05:14:18,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:18,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2024-10-26 05:14:18,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 45 [2024-10-26 05:14:18,828 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:18,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2024-10-26 05:14:18,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:18,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 41 [2024-10-26 05:14:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-10-26 05:14:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801449009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:14:25,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:14:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 44 [2024-10-26 05:14:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602540057] [2024-10-26 05:14:25,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:14:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-26 05:14:25,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:14:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-26 05:14:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=20, NotChecked=400, Total=1980 [2024-10-26 05:14:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:25,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:14:25,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.295454545454546) internal successors, (189), 45 states have internal predecessors, (189), 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-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:14:25,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:14:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:14:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:14:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:14:28,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 05:14:28,571 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,SelfDestructingSolverStorable5 [2024-10-26 05:14:28,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:14:28,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:14:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1126965694, now seen corresponding path program 2 times [2024-10-26 05:14:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:14:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117917331] [2024-10-26 05:14:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:14:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:14:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:14:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:14:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117917331] [2024-10-26 05:14:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117917331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:14:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330461005] [2024-10-26 05:14:30,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:14:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:14:30,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:14:30,276 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-10-26 05:14:30,277 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-10-26 05:14:30,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:14:30,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:14:30,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-26 05:14:30,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:14:30,391 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-10-26 05:14:30,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:14:30,415 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-10-26 05:14:30,466 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 1 [2024-10-26 05:14:30,471 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-10-26 05:14:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:14:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:14:30,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:14:30,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:14:30,788 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 13 treesize of output 9 [2024-10-26 05:14:30,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:14:30,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 05:14:31,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:14:31,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:14:31,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-26 05:14:31,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 05:14:31,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:31,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:14:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:14:31,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:14:31,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:14:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:14:31,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:31,335 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 48 treesize of output 56 [2024-10-26 05:14:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:31,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:14:34,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))))) is different from false [2024-10-26 05:14:34,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|)))))) is different from false [2024-10-26 05:14:36,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))))) is different from false [2024-10-26 05:14:36,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|)))))) is different from false [2024-10-26 05:14:36,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_780) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_785))) (store .cse9 .cse2 (store (select .cse9 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2024-10-26 05:14:36,651 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2024-10-26 05:14:36,652 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 1348 treesize of output 1072 [2024-10-26 05:14:36,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:36,677 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 418 treesize of output 376 [2024-10-26 05:14:36,692 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 124 treesize of output 120 [2024-10-26 05:14:36,705 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 253 treesize of output 237 [2024-10-26 05:14:36,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:36,930 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2024-10-26 05:14:36,931 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 678 treesize of output 1 [2024-10-26 05:14:36,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:36,948 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2024-10-26 05:14:36,949 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 414 treesize of output 1 [2024-10-26 05:14:36,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:36,995 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2024-10-26 05:14:36,996 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 678 treesize of output 491 [2024-10-26 05:14:37,008 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 80 treesize of output 76 [2024-10-26 05:14:37,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 158 [2024-10-26 05:14:37,476 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 37 treesize of output 35 [2024-10-26 05:14:37,480 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 42 treesize of output 40 [2024-10-26 05:14:37,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-26 05:14:37,487 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 15 treesize of output 13 [2024-10-26 05:14:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-26 05:14:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330461005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:14:37,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:14:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 51 [2024-10-26 05:14:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254563886] [2024-10-26 05:14:37,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:14:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 05:14:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:14:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 05:14:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1965, Unknown=22, NotChecked=470, Total=2652 [2024-10-26 05:14:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:37,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:14:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.4705882352941178) internal successors, (177), 52 states have internal predecessors, (177), 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-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:14:37,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:14:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:14:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:14:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:14:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 05:14:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:14:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:14:42,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-26 05:14:42,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:14:42,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:14:42,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:14:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1704898398, now seen corresponding path program 4 times [2024-10-26 05:14:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:14:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534364294] [2024-10-26 05:14:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:14:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:14:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:14:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:14:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534364294] [2024-10-26 05:14:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534364294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:14:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347472731] [2024-10-26 05:14:43,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 05:14:43,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:14:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:14:43,641 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-10-26 05:14:43,641 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-10-26 05:14:43,945 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 05:14:43,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:14:43,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-26 05:14:43,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:14:43,959 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-10-26 05:14:44,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:14:44,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:14:44,413 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-10-26 05:14:44,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:14:44,709 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:14:44,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-26 05:14:44,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-26 05:14:44,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-10-26 05:14:44,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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-10-26 05:14:45,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:14:45,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:14:45,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-10-26 05:14:45,345 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 70 treesize of output 52 [2024-10-26 05:14:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:14:45,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:14:45,444 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:14:45,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:45,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 117 [2024-10-26 05:14:45,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse2 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse3 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_2) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_3) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_prenex_1 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_1) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|))))))) is different from false [2024-10-26 05:14:45,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse4 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse0 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse2 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse3 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_3) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (forall ((v_prenex_1 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_1) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_2) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|))))))) is different from false [2024-10-26 05:14:46,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse4 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse0 (+ .cse7 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse2 (+ .cse7 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse3 (+ .cse7 |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_prenex_1 (Array Int Int))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_1) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_2) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_3) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_ArrVal_940 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) .cse6))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse0))) (not (= |c_ULTIMATE.start_main_#t~nondet8#1| (select v_arrayElimArr_18 .cse1))) (not (= (select v_arrayElimArr_18 .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (not (= (select v_arrayElimArr_18 .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|))))))) is different from false [2024-10-26 05:14:46,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse5 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse6 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse1)) (not (= .cse1 (select v_arrayElimArr_18 .cse2))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_2) c_threadThread1of1ForFork0_~t~0.base) .cse3)) (not (= .cse1 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse7)) (not (= .cse7 (select v_arrayElimArr_18 .cse2))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_1) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse7 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse8)) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_prenex_3) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse8 (select v_arrayElimArr_18 .cse2))) (not (= .cse8 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse9)) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse9 (select v_arrayElimArr_18 .cse2))) (not (= .cse9 (select v_arrayElimArr_18 .cse5))))))))) is different from false [2024-10-26 05:14:46,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse4 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse6 (+ .cse10 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse1)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_3) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))) (not (= .cse1 (select v_arrayElimArr_18 .cse4))) (not (= .cse1 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse7)) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_940) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse7 (select v_arrayElimArr_18 .cse4))) (not (= .cse7 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse8)) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_2) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse8 (select v_arrayElimArr_18 .cse4))) (not (= .cse8 (select v_arrayElimArr_18 .cse5)))))) (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_18 .cse6))) (or (not (= (select v_arrayElimArr_18 .cse0) .cse9)) (not (= .cse9 (select v_arrayElimArr_18 .cse4))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_934) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_1) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= .cse9 (select v_arrayElimArr_18 .cse5))))))))) is different from false [2024-10-26 05:14:57,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 156 [2024-10-26 05:14:57,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,321 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 107 treesize of output 71 [2024-10-26 05:14:57,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 78 [2024-10-26 05:14:57,362 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 28 treesize of output 20 [2024-10-26 05:14:57,382 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:57,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,392 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 55 treesize of output 13 [2024-10-26 05:14:57,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:57,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2024-10-26 05:14:57,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,418 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 61 treesize of output 37 [2024-10-26 05:14:57,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,426 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 55 treesize of output 13 [2024-10-26 05:14:57,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:14:57,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:14:57,441 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 55 treesize of output 13 [2024-10-26 05:15:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-10-26 05:15:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347472731] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:15:03,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:15:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 21] total 54 [2024-10-26 05:15:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433799591] [2024-10-26 05:15:03,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:15:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-26 05:15:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:15:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-26 05:15:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2102, Unknown=30, NotChecked=594, Total=2970 [2024-10-26 05:15:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:03,937 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:15:03,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 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-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:15:03,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:08,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:10,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:12,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:14,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:16,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:18,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:20,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:22,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:24,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:26,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:28,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:30,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:33,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:35,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:37,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:39,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:41,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:43,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 05:15:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:15:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:15:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:15:44,625 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-10-26 05:15:44,811 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,SelfDestructingSolverStorable7 [2024-10-26 05:15:44,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:15:44,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:15:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1235178890, now seen corresponding path program 3 times [2024-10-26 05:15:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:15:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353894107] [2024-10-26 05:15:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:15:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:15:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:15:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:15:46,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:15:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353894107] [2024-10-26 05:15:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353894107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:15:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675863211] [2024-10-26 05:15:46,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 05:15:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:15:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:15:46,258 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-10-26 05:15:46,259 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-10-26 05:15:46,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-26 05:15:46,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:15:46,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-26 05:15:46,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:15:46,394 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-10-26 05:15:46,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:15:46,427 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-10-26 05:15:46,501 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 1 [2024-10-26 05:15:46,508 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-10-26 05:15:46,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:15:46,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:15:46,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:15:46,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:15:46,781 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 13 treesize of output 9 [2024-10-26 05:15:46,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:15:47,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:15:47,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:15:47,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-10-26 05:15:47,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 05:15:47,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 05:15:47,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:15:47,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:15:47,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:15:47,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:15:47,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:15:47,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:15:47,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:15:47,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:15:47,340 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 48 treesize of output 56 [2024-10-26 05:15:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:15:47,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:15:48,207 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:15:48,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:15:48,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6)))))) is different from false [2024-10-26 05:15:48,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:15:48,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|)))))) is different from false [2024-10-26 05:15:50,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))))) is different from false [2024-10-26 05:15:50,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 5 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1066) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1073))) (store .cse9 .cse1 (store (select .cse9 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|)))))) is different from false [2024-10-26 05:15:50,867 INFO L349 Elim1Store]: treesize reduction 28, result has 63.2 percent of original size [2024-10-26 05:15:50,867 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 1006 treesize of output 849 [2024-10-26 05:15:50,881 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 314 treesize of output 298 [2024-10-26 05:15:50,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:15:50,902 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 475 treesize of output 423 [2024-10-26 05:15:50,914 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 166 treesize of output 162 [2024-10-26 05:15:51,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:15:51,066 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-10-26 05:15:51,066 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 310 treesize of output 1 [2024-10-26 05:15:51,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:15:51,077 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-10-26 05:15:51,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 1 [2024-10-26 05:15:51,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:15:51,088 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-10-26 05:15:51,088 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 198 treesize of output 1 [2024-10-26 05:15:51,464 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 37 treesize of output 35 [2024-10-26 05:15:51,467 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 42 treesize of output 40 [2024-10-26 05:15:51,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-26 05:15:51,474 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 15 treesize of output 13 [2024-10-26 05:15:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-26 05:15:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675863211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:15:51,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:15:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 51 [2024-10-26 05:15:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232015456] [2024-10-26 05:15:51,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:15:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 05:15:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:15:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 05:15:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1839, Unknown=7, NotChecked=644, Total=2652 [2024-10-26 05:15:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:51,672 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:15:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.4705882352941178) internal successors, (177), 52 states have internal predecessors, (177), 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-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:15:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:15:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:15:56,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-26 05:15:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:15:56,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:15:56,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:15:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1179330572, now seen corresponding path program 5 times [2024-10-26 05:15:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:15:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036096005] [2024-10-26 05:15:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:15:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:15:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:15:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:15:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:15:57,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036096005] [2024-10-26 05:15:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036096005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:15:57,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117713596] [2024-10-26 05:15:57,216 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 05:15:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:15:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:15:57,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:15:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 05:15:57,354 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:15:57,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:15:57,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-26 05:15:57,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:15:57,361 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-10-26 05:15:57,415 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:15:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:15:57,747 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-10-26 05:15:57,924 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:15:57,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-26 05:15:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:15:58,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:15:58,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-10-26 05:15:58,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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-10-26 05:15:58,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:15:58,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:15:58,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:15:58,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 05:15:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:15:58,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:15:58,377 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:15:58,426 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:15:58,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:15:58,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:15:58,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:15:58,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1219) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:15:58,982 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 28 treesize of output 20 [2024-10-26 05:15:58,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 05:15:58,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:15:59,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:15:59,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:15:59,009 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 39 treesize of output 39 [2024-10-26 05:15:59,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-10-26 05:15:59,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-10-26 05:16:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117713596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:16:01,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:16:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 17] total 48 [2024-10-26 05:16:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363530392] [2024-10-26 05:16:01,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:16:01,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-26 05:16:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-26 05:16:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1604, Unknown=30, NotChecked=522, Total=2352 [2024-10-26 05:16:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:01,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 4.0625) internal successors, (195), 49 states have internal predecessors, (195), 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-10-26 05:16:01,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:01,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:01,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:01,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 05:16:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:04,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-26 05:16:04,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-26 05:16:04,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1736098656, now seen corresponding path program 4 times [2024-10-26 05:16:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106401470] [2024-10-26 05:16:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106401470] [2024-10-26 05:16:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106401470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:16:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494551437] [2024-10-26 05:16:06,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 05:16:06,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:06,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:16:06,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 05:16:06,315 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 05:16:06,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:16:06,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-26 05:16:06,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:16:06,324 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-10-26 05:16:06,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:06,350 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-10-26 05:16:06,366 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-10-26 05:16:06,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 11 treesize of output 7 [2024-10-26 05:16:06,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:06,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:06,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:06,692 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-10-26 05:16:06,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-26 05:16:06,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:16:06,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:06,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:16:06,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 05:16:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 05:16:07,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:16:07,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:16:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 05:16:07,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:07,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:07,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:07,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:07,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:07,219 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 40 treesize of output 48 [2024-10-26 05:16:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:07,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:16:09,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:16:09,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:16:09,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse7 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:16:09,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:16:09,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse9)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse9)) (.cse2 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse5 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse8 .cse1 (store (select .cse8 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2024-10-26 05:16:11,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1350) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1357))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2024-10-26 05:16:12,135 INFO L349 Elim1Store]: treesize reduction 23, result has 65.2 percent of original size [2024-10-26 05:16:12,136 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 772 treesize of output 690 [2024-10-26 05:16:12,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:12,153 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 452 treesize of output 406 [2024-10-26 05:16:12,160 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 147 treesize of output 143 [2024-10-26 05:16:12,171 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 239 treesize of output 223 [2024-10-26 05:16:12,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:12,279 INFO L349 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2024-10-26 05:16:12,279 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 198 treesize of output 1 [2024-10-26 05:16:12,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:12,290 INFO L349 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2024-10-26 05:16:12,290 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 198 treesize of output 1 [2024-10-26 05:16:12,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:12,309 INFO L349 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2024-10-26 05:16:12,309 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 198 treesize of output 1 [2024-10-26 05:16:12,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-26 05:16:12,673 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 15 treesize of output 13 [2024-10-26 05:16:12,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-26 05:16:12,678 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 16 treesize of output 14 [2024-10-26 05:16:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-26 05:16:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494551437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:16:12,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:16:12,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 47 [2024-10-26 05:16:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111477529] [2024-10-26 05:16:12,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:16:12,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-26 05:16:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:12,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-26 05:16:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1569, Unknown=20, NotChecked=510, Total=2256 [2024-10-26 05:16:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:12,866 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.574468085106383) internal successors, (168), 48 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:12,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:12,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:12,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:16:16,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-26 05:16:16,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-26 05:16:16,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1252147038, now seen corresponding path program 6 times [2024-10-26 05:16:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772814239] [2024-10-26 05:16:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:17,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772814239] [2024-10-26 05:16:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772814239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:16:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471622382] [2024-10-26 05:16:17,302 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 05:16:17,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:17,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:17,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:16:17,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-26 05:16:17,490 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-26 05:16:17,490 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:16:17,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-26 05:16:17,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:16:17,498 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-10-26 05:16:17,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:17,562 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-10-26 05:16:17,959 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-10-26 05:16:17,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:16:18,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 05:16:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 05:16:18,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 05:16:18,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-10-26 05:16:18,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:16:18,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:18,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:18,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:16:18,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:18,323 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-10-26 05:16:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:18,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:16:26,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,088 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 73 treesize of output 64 [2024-10-26 05:16:26,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,096 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 342 treesize of output 304 [2024-10-26 05:16:26,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 158 [2024-10-26 05:16:26,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,143 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 74 treesize of output 38 [2024-10-26 05:16:26,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,160 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 73 treesize of output 64 [2024-10-26 05:16:26,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:26,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:26,169 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 110 treesize of output 96 [2024-10-26 05:16:26,175 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-10-26 05:16:26,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-10-26 05:16:26,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,211 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 73 treesize of output 64 [2024-10-26 05:16:26,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:26,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:26,220 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 142 treesize of output 120 [2024-10-26 05:16:26,227 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-10-26 05:16:26,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-10-26 05:16:26,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:26,254 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 73 treesize of output 64 [2024-10-26 05:16:26,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:26,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:26,264 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 142 treesize of output 120 [2024-10-26 05:16:26,270 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-10-26 05:16:26,274 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 114 treesize of output 70 [2024-10-26 05:16:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471622382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:16:26,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:16:26,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 46 [2024-10-26 05:16:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113737795] [2024-10-26 05:16:26,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:16:26,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-26 05:16:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-26 05:16:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1903, Unknown=95, NotChecked=0, Total=2162 [2024-10-26 05:16:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:26,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:26,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.1521739130434785) internal successors, (191), 47 states have internal predecessors, (191), 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-10-26 05:16:26,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:26,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:26,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:26,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:16:26,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:16:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:31,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-26 05:16:31,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:31,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1814686824, now seen corresponding path program 5 times [2024-10-26 05:16:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046365176] [2024-10-26 05:16:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046365176] [2024-10-26 05:16:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046365176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:16:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461856008] [2024-10-26 05:16:33,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 05:16:33,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:33,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:33,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:16:33,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-26 05:16:33,455 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:16:33,455 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:16:33,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-26 05:16:33,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:16:33,462 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-10-26 05:16:33,527 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:33,528 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-10-26 05:16:33,583 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-10-26 05:16:33,588 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-10-26 05:16:33,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:33,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:16:33,910 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 05:16:33,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-26 05:16:33,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-26 05:16:33,927 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-26 05:16:33,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-26 05:16:34,080 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 23 treesize of output 11 [2024-10-26 05:16:34,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-26 05:16:34,121 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-10-26 05:16:34,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:16:34,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 05:16:34,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 05:16:34,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 05:16:34,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:16:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 05:16:34,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:34,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 40 treesize of output 48 [2024-10-26 05:16:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:34,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:16:34,660 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1641))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1641))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1641))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1641))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:16:35,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,231 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 73 treesize of output 64 [2024-10-26 05:16:35,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,238 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 210 treesize of output 190 [2024-10-26 05:16:35,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 173 treesize of output 157 [2024-10-26 05:16:35,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,319 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 83 treesize of output 51 [2024-10-26 05:16:35,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,337 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 73 treesize of output 64 [2024-10-26 05:16:35,340 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:35,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:35,347 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 142 treesize of output 120 [2024-10-26 05:16:35,353 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-10-26 05:16:35,357 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 114 treesize of output 70 [2024-10-26 05:16:35,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,382 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 73 treesize of output 64 [2024-10-26 05:16:35,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:35,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:35,393 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 110 treesize of output 96 [2024-10-26 05:16:35,399 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-10-26 05:16:35,403 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 102 treesize of output 66 [2024-10-26 05:16:35,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:35,426 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 73 treesize of output 64 [2024-10-26 05:16:35,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:35,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:35,439 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 142 treesize of output 120 [2024-10-26 05:16:35,445 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-10-26 05:16:35,449 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 114 treesize of output 70 [2024-10-26 05:16:36,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-26 05:16:36,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-26 05:16:36,687 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 12 treesize of output 10 [2024-10-26 05:16:36,690 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 15 treesize of output 13 [2024-10-26 05:16:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461856008] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:16:36,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:16:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2024-10-26 05:16:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163685178] [2024-10-26 05:16:36,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:16:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-26 05:16:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-26 05:16:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2493, Unknown=48, NotChecked=102, Total=2862 [2024-10-26 05:16:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:36,946 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 3.4339622641509435) internal successors, (182), 54 states have internal predecessors, (182), 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-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:16:36,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:36,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:16:44,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-26 05:16:44,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-26 05:16:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-26 05:16:44,330 INFO L407 BasicCegarLoop]: Path program histogram: [6, 5, 1, 1] [2024-10-26 05:16:44,331 INFO L312 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-10-26 05:16:44,338 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:16:44,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:16:44,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:44,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 05:16:44,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-10-26 05:16:44,346 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:16:44,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 05:16:44,347 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;@55b014cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:16:44,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-26 05:16:44,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 05:16:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1159525782, now seen corresponding path program 1 times [2024-10-26 05:16:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43987492] [2024-10-26 05:16:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43987492] [2024-10-26 05:16:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43987492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:16:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:16:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:16:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777601860] [2024-10-26 05:16:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:16:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:16:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:16:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:16:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:16:44,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-26 05:16:44,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 05:16:44,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1971613969, now seen corresponding path program 1 times [2024-10-26 05:16:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357338387] [2024-10-26 05:16:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357338387] [2024-10-26 05:16:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357338387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:16:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:16:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:16:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239663041] [2024-10-26 05:16:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:16:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:16:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:16:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:16:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:44,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-10-26 05:16:44,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-26 05:16:44,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 05:16:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -273716679, now seen corresponding path program 1 times [2024-10-26 05:16:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865731143] [2024-10-26 05:16:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865731143] [2024-10-26 05:16:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865731143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:16:44,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:16:44,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:16:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414939899] [2024-10-26 05:16:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:16:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:16:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:16:44,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:16:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,703 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-10-26 05:16:44,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:44,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:44,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-26 05:16:44,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 05:16:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 963506685, now seen corresponding path program 1 times [2024-10-26 05:16:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050023856] [2024-10-26 05:16:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 05:16:44,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 05:16:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 05:16:44,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 05:16:44,954 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 05:16:44,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-26 05:16:44,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-26 05:16:44,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-26 05:16:44,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-26 05:16:44,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-26 05:16:44,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-26 05:16:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-26 05:16:44,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-26 05:16:44,959 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-26 05:16:44,959 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 05:16:44,959 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 05:16:44,980 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 05:16:44,985 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:16:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:16:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:44,988 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 05:16:44,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-26 05:16:44,992 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:16:44,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-10-26 05:16:44,993 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;@55b014cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:16:44,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-26 05:16:45,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:45,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1816520541, now seen corresponding path program 1 times [2024-10-26 05:16:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610019538] [2024-10-26 05:16:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:45,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:45,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610019538] [2024-10-26 05:16:45,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610019538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:16:45,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:16:45,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:16:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739476841] [2024-10-26 05:16:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:16:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:16:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:16:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:16:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:45,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:45,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:16:45,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-26 05:16:45,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 964985119, now seen corresponding path program 1 times [2024-10-26 05:16:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365541145] [2024-10-26 05:16:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:45,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365541145] [2024-10-26 05:16:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365541145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:16:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:16:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:16:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086375585] [2024-10-26 05:16:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:16:45,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:16:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:16:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:16:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:45,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:45,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:16:45,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:45,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-26 05:16:47,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -935584872, now seen corresponding path program 1 times [2024-10-26 05:16:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329235934] [2024-10-26 05:16:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329235934] [2024-10-26 05:16:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329235934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:16:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552579855] [2024-10-26 05:16:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:47,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:16:47,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-26 05:16:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:47,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-26 05:16:47,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:16:47,788 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-10-26 05:16:47,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:16:47,821 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-10-26 05:16:47,852 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 13 treesize of output 9 [2024-10-26 05:16:47,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:16:47,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:47,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 32 treesize of output 34 [2024-10-26 05:16:47,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:47,884 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 41 treesize of output 46 [2024-10-26 05:16:48,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:16:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:48,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:16:48,032 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:16:48,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1986) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2024-10-26 05:16:52,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:52,265 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 37 treesize of output 53 [2024-10-26 05:16:52,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:52,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2024-10-26 05:16:52,274 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:16:52,274 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:16:52,278 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:16:52,278 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:16:52,282 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 05:16:52,282 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 05:16:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-26 05:16:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552579855] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:16:52,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:16:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-10-26 05:16:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53951498] [2024-10-26 05:16:52,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:16:52,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 05:16:52,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:16:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 05:16:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=239, Unknown=18, NotChecked=66, Total=380 [2024-10-26 05:16:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:52,317 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:16:52,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 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-10-26 05:16:52,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:52,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:52,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:16:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:16:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:16:54,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-26 05:16:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:55,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:16:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:16:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1505004977, now seen corresponding path program 2 times [2024-10-26 05:16:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:16:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967204764] [2024-10-26 05:16:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:16:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:16:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:16:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:16:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967204764] [2024-10-26 05:16:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967204764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:16:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106990626] [2024-10-26 05:16:55,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:16:55,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:16:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:16:55,859 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:16:55,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-26 05:16:56,029 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:16:56,029 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:16:56,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-26 05:16:56,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:16:56,036 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-10-26 05:16:56,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:16:56,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:16:56,283 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 13 treesize of output 9 [2024-10-26 05:16:56,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:16:56,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:56,358 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 32 treesize of output 34 [2024-10-26 05:16:56,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:56,430 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 41 treesize of output 46 [2024-10-26 05:16:56,598 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:16:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-26 05:16:56,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:16:56,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:16:56,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:16:56,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:16:56,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 45 treesize of output 34 [2024-10-26 05:16:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:16:56,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:16:56,877 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2141 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2141 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2141 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2141 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:16:57,084 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2141 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2141 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2141 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_2141 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2141) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))) is different from false [2024-10-26 05:16:58,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,058 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 40 treesize of output 56 [2024-10-26 05:16:58,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 66 [2024-10-26 05:16:58,070 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 28 treesize of output 24 [2024-10-26 05:16:58,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-10-26 05:16:58,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,094 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 40 treesize of output 56 [2024-10-26 05:16:58,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:58,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:16:58,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,112 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 40 treesize of output 56 [2024-10-26 05:16:58,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:58,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:16:58,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,130 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 40 treesize of output 56 [2024-10-26 05:16:58,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:16:58,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:16:58,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 05:17:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-10-26 05:17:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106990626] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:17:00,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:17:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2024-10-26 05:17:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814938550] [2024-10-26 05:17:00,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:17:00,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-26 05:17:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:17:00,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-26 05:17:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1484, Unknown=37, NotChecked=162, Total=1892 [2024-10-26 05:17:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:00,592 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:17:00,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 4.395348837209302) internal successors, (189), 44 states have internal predecessors, (189), 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-10-26 05:17:00,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:00,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:00,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:00,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:02,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-26 05:17:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-26 05:17:02,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:17:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:17:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 367713573, now seen corresponding path program 1 times [2024-10-26 05:17:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:17:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635296065] [2024-10-26 05:17:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:17:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-26 05:17:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:17:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635296065] [2024-10-26 05:17:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635296065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:17:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:17:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 05:17:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267600638] [2024-10-26 05:17:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:17:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:17:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:17:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:17:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:17:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:02,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:17:02,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:17:02,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:02,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:02,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:02,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:02,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:03,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 05:17:03,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:17:03,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:17:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1856316077, now seen corresponding path program 1 times [2024-10-26 05:17:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:17:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838106505] [2024-10-26 05:17:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:17:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-26 05:17:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:17:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838106505] [2024-10-26 05:17:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838106505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:17:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:17:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 05:17:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690521717] [2024-10-26 05:17:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:17:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:17:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:17:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:17:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:17:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:04,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:17:04,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:05,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-26 05:17:05,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:17:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:17:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 313299, now seen corresponding path program 1 times [2024-10-26 05:17:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:17:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040380563] [2024-10-26 05:17:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:17:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:17:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:17:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040380563] [2024-10-26 05:17:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040380563] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:17:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890022422] [2024-10-26 05:17:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:17:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:17:06,845 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:17:06,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-26 05:17:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:07,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-26 05:17:07,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:17:07,046 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-10-26 05:17:07,063 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:17:07,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:17:07,294 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 13 treesize of output 9 [2024-10-26 05:17:07,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:17:07,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:07,383 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 32 treesize of output 34 [2024-10-26 05:17:07,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:07,438 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 41 treesize of output 46 [2024-10-26 05:17:07,625 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-26 05:17:07,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2024-10-26 05:17:07,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:07,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:07,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:07,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,420 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-26 05:17:08,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 05:17:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:17:08,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:17:09,046 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))) is different from false [2024-10-26 05:17:09,055 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2611 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2024-10-26 05:17:09,685 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2024-10-26 05:17:09,767 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:17:09,826 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2606) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2610) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_2611) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2024-10-26 05:17:19,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,140 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 43 treesize of output 59 [2024-10-26 05:17:19,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 258 [2024-10-26 05:17:19,154 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 51 treesize of output 47 [2024-10-26 05:17:19,157 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 110 treesize of output 94 [2024-10-26 05:17:19,161 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 54 treesize of output 46 [2024-10-26 05:17:19,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 59 [2024-10-26 05:17:19,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 782 treesize of output 530 [2024-10-26 05:17:19,237 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 62 treesize of output 54 [2024-10-26 05:17:19,240 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 106 treesize of output 90 [2024-10-26 05:17:19,244 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 43 treesize of output 39 [2024-10-26 05:17:19,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,317 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 43 treesize of output 59 [2024-10-26 05:17:19,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 134 [2024-10-26 05:17:19,334 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 114 treesize of output 98 [2024-10-26 05:17:19,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2024-10-26 05:17:19,345 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 50 treesize of output 46 [2024-10-26 05:17:19,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,430 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 43 treesize of output 59 [2024-10-26 05:17:19,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:19,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 718 treesize of output 514 [2024-10-26 05:17:19,445 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 51 treesize of output 43 [2024-10-26 05:17:19,448 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 43 treesize of output 39 [2024-10-26 05:17:19,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2024-10-26 05:17:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 9 times theorem prover too weak. 0 trivial. 40 not checked. [2024-10-26 05:17:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890022422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:17:24,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:17:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 57 [2024-10-26 05:17:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502285309] [2024-10-26 05:17:24,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:17:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-26 05:17:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:17:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-26 05:17:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2392, Unknown=61, NotChecked=530, Total=3306 [2024-10-26 05:17:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:24,667 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:17:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 5.350877192982456) internal successors, (305), 58 states have internal predecessors, (305), 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-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:24,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:17:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 05:17:31,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-26 05:17:31,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-26 05:17:31,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:17:31,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:17:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1867382471, now seen corresponding path program 1 times [2024-10-26 05:17:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:17:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615859005] [2024-10-26 05:17:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:17:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:17:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:17:34,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615859005] [2024-10-26 05:17:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615859005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:17:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037472796] [2024-10-26 05:17:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:17:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:17:34,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:17:34,681 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:17:34,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-26 05:17:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:17:34,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-26 05:17:34,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:17:34,895 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-10-26 05:17:34,963 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:17:34,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:17:35,038 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-10-26 05:17:35,045 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 1 [2024-10-26 05:17:35,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:17:35,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 16 treesize of output 11 [2024-10-26 05:17:35,451 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-26 05:17:35,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-26 05:17:35,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:35,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:17:35,480 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 13 treesize of output 9 [2024-10-26 05:17:35,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:17:35,598 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 32 treesize of output 34 [2024-10-26 05:17:35,660 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 41 treesize of output 46 [2024-10-26 05:17:36,013 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-26 05:17:36,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-26 05:17:36,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:36,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-26 05:17:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-10-26 05:17:36,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-10-26 05:17:36,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:17:36,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 34 [2024-10-26 05:17:37,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:37,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-26 05:17:37,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:17:37,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:37,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:37,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:37,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:17:37,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:37,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:37,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:37,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:17:37,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:17:37,305 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 48 treesize of output 56 [2024-10-26 05:17:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:17:37,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:17:48,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) is different from false [2024-10-26 05:17:48,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))))) is different from false [2024-10-26 05:17:48,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))))) is different from false [2024-10-26 05:17:48,816 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int))) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int))) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))) is different from false [2024-10-26 05:17:49,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_~t~1#1.base|)))) (and (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse0 .cse1 v_ArrVal_2803)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse0 .cse1 v_ArrVal_2803)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse0 .cse1 v_ArrVal_2803)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse0 .cse1 v_ArrVal_2803)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse10 (select (select (store .cse4 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))))))) is different from false [2024-10-26 05:17:49,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (and (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_2803)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_2803)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse8 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_2803)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_2803)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse10 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))))))) is different from false [2024-10-26 05:18:21,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:21,266 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 117 treesize of output 108 [2024-10-26 05:18:21,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:21,333 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 9554 treesize of output 8321 [2024-10-26 05:18:21,389 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 1098 treesize of output 1066 [2024-10-26 05:18:21,445 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 1210 treesize of output 1146 [2024-10-26 05:18:25,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:25,491 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 567 treesize of output 523 [2024-10-26 05:18:26,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:26,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 108 [2024-10-26 05:18:26,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:18:26,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:26,815 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 834 treesize of output 783 [2024-10-26 05:18:26,854 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 698 treesize of output 666 [2024-10-26 05:18:26,890 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 367 treesize of output 359 [2024-10-26 05:18:27,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:27,655 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 215 treesize of output 179 [2024-10-26 05:18:28,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:28,448 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 117 treesize of output 108 [2024-10-26 05:18:28,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:18:28,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:28,532 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 1354 treesize of output 1215 [2024-10-26 05:18:28,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 321 [2024-10-26 05:18:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 638 [2024-10-26 05:18:29,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:29,569 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 302 treesize of output 246 [2024-10-26 05:18:30,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:30,788 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 117 treesize of output 108 [2024-10-26 05:18:30,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:18:30,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:30,868 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 898 treesize of output 831 [2024-10-26 05:18:30,906 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 698 treesize of output 666 [2024-10-26 05:18:30,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 359 [2024-10-26 05:18:31,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:18:31,543 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 182 treesize of output 142 [2024-10-26 05:19:45,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:19:45,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1229 treesize of output 1205 [2024-10-26 05:19:45,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:19:45,418 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 1296 treesize of output 1177 [2024-10-26 05:19:45,459 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 1172 treesize of output 1170 [2024-10-26 05:19:45,500 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 1170 treesize of output 1168 [2024-10-26 05:19:45,536 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 1174 treesize of output 1172 [2024-10-26 05:19:45,563 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 1172 treesize of output 1170 [2024-10-26 05:19:45,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1177 treesize of output 1175 [2024-10-26 05:19:45,624 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 1164 treesize of output 1162 [2024-10-26 05:19:45,666 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 1394 treesize of output 1370 [2024-10-26 05:19:45,696 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 1367 treesize of output 1363 [2024-10-26 05:19:45,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1351 treesize of output 1349 [2024-10-26 05:19:45,767 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 1441 treesize of output 1427 [2024-10-26 05:19:45,849 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 1429 treesize of output 1425 [2024-10-26 05:19:45,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:19:45,948 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 1501 treesize of output 1481 [2024-10-26 05:19:46,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1736 treesize of output 1722 [2024-10-26 05:19:46,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1507 treesize of output 1505 [2024-10-26 05:19:46,095 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 1518 treesize of output 1514 [2024-10-26 05:19:46,132 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 1519 treesize of output 1515 [2024-10-26 05:19:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1512 treesize of output 1510 [2024-10-26 05:19:46,199 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 1510 treesize of output 1508 [2024-10-26 05:19:46,229 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 1508 treesize of output 1506 [2024-10-26 05:19:46,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1514 treesize of output 1512 [2024-10-26 05:19:46,302 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 1519 treesize of output 1517 [2024-10-26 05:19:46,334 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 1524 treesize of output 1522 [2024-10-26 05:19:46,365 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 1522 treesize of output 1520 [2024-10-26 05:19:46,397 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 1527 treesize of output 1525 [2024-10-26 05:19:46,428 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 1525 treesize of output 1523 [2024-10-26 05:19:46,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1523 treesize of output 1519 [2024-10-26 05:19:46,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1519 treesize of output 1515 [2024-10-26 05:19:46,524 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 1529 treesize of output 1525 [2024-10-26 05:19:46,560 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 1514 treesize of output 1510 [2024-10-26 05:19:46,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1510 treesize of output 1506 [2024-10-26 05:19:46,623 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 1506 treesize of output 1504 [2024-10-26 05:19:46,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1504 treesize of output 1502 [2024-10-26 05:19:46,688 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 1509 treesize of output 1507 [2024-10-26 05:19:46,724 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 1496 treesize of output 1494 [2024-10-26 05:19:46,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1500 treesize of output 1498 [2024-10-26 05:19:46,798 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 1498 treesize of output 1496 [2024-10-26 05:19:46,832 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 1502 treesize of output 1500 [2024-10-26 05:19:46,880 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 1500 treesize of output 1498 [2024-10-26 05:19:46,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1498 treesize of output 1496 [2024-10-26 05:19:46,987 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 1496 treesize of output 1492 [2024-10-26 05:19:47,018 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 1492 treesize of output 1490 [2024-10-26 05:19:47,051 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 1496 treesize of output 1494 [2024-10-26 05:19:47,088 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 1485 treesize of output 1483 [2024-10-26 05:19:47,123 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 1491 treesize of output 1487 [2024-10-26 05:19:47,168 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 1482 treesize of output 1478 [2024-10-26 05:19:47,201 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 1486 treesize of output 1484 [2024-10-26 05:19:47,235 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 1484 treesize of output 1482 [2024-10-26 05:19:47,268 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 1489 treesize of output 1487 [2024-10-26 05:19:47,300 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 1487 treesize of output 1485 [2024-10-26 05:20:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2024-10-26 05:20:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037472796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:20:11,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:20:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 26] total 72 [2024-10-26 05:20:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435682565] [2024-10-26 05:20:11,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:20:11,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-10-26 05:20:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:11,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-10-26 05:20:11,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=3873, Unknown=114, NotChecked=810, Total=5256 [2024-10-26 05:20:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:11,237 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:11,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 3.736111111111111) internal successors, (269), 73 states have internal predecessors, (269), 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-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:11,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:11,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 05:20:11,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 05:20:40,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:42,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:44,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:46,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:48,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:50,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:53,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:55,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:57,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:20:59,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:01,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:03,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:05,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:07,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:09,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:11,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:13,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:30,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:32,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-26 05:21:48,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:50,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:52,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:54,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:56,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:21:59,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:01,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:03,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:05,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:07,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:09,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:11,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:13,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:15,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:19,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:21,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:23,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:25,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:27,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:29,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:31,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:33,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:35,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:37,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:39,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:43,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:45,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:48,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:50,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:52,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:54,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:56,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:22:59,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:01,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:03,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:05,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:07,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:09,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:11,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:14,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:16,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:18,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:20,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:22,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:25,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:27,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:38,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:40,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:42,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:44,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:46,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:48,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:50,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:52,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:54,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:23:57,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 05:24:06,120 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse0 (select |c_#race| c_threadThread1of2ForFork0_~t~0.base)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse39 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse20 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse21 (+ |c_ULTIMATE.start_main_#t~post12#1| 1)) (.cse16 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store .cse0 .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse39 |c_threadThread1of2ForFork0_#t~nondet4|) .cse20 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse33 (select .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse35 (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse28 (not (= |c_ULTIMATE.start_main_~ts~0#1.base| c_threadThread1of2ForFork0_~t~0.base))) (.cse10 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store .cse0 .cse39 |c_threadThread1of2ForFork0_#t~nondet4|) .cse20 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse81 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store .cse0 .cse20 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 4)) (.cse12 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 4) |c_threadThread1of2ForFork0_#t~nondet4|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse2 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6))))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse7 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse7 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse15 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= (select (select (let ((.cse13 (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse15 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_22 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_22) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse17 |c_ULTIMATE.start_main_~ts~0#1.base|)) (not (= .cse17 c_threadThread1of2ForFork0_~t~0.base))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse18 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse18 .cse19 (store (select .cse18 .cse19) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse2 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse21) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse22 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse22 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse23 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse23 .cse24 (store (select .cse23 .cse24) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20)))))))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse25 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse25 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse26 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse25 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse26 .cse27 (store (select .cse26 .cse27) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or .cse28 (forall ((v_prenex_10 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int)) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_10) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| .cse29) (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse29) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))))) (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse32 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2809 (Array Int Int))) (let ((.cse30 (select (select (store (let ((.cse31 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse31 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse30 c_threadThread1of2ForFork0_~t~0.base)) (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse30)))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792) |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse32 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse6))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse33 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse34 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse38 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse36 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse38 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse36 .cse37 (store (select .cse36 .cse37) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse38 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse21))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse33 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse40 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse40 .cse35 (store (select .cse40 .cse35) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_23) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) .cse28) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse41 (select (select (store (let ((.cse42 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse42 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~ts~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_4) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse41 c_threadThread1of2ForFork0_~t~0.base)) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse41))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_22 (Array Int Int))) (let ((.cse43 (select (select (store (let ((.cse44 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse44 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~ts~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_22) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse43 c_threadThread1of2ForFork0_~t~0.base)) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse43))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_prenex_17 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_17) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) .cse28) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse45 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse45 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse46 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse45 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse46 .cse47 (store (select .cse46 .cse47) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse21))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 .cse39)) (not (= (select |c_#valid| c_threadThread1of2ForFork0_~t~0.base) 0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse48 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse48 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse39)) (forall ((v_prenex_9 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse48 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_9) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base)))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_21 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_21) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse49 |c_ULTIMATE.start_main_~ts~0#1.base|)) (not (= .cse49 c_threadThread1of2ForFork0_~t~0.base))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse2 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse50 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse50 .cse51 (store (select .cse50 .cse51) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)))) (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse53 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (let ((.cse52 (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792))) (store .cse52 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse53 v_ArrVal_2803))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse20)) (forall ((v_ArrVal_2809 (Array Int Int))) (not (= (select (select (store (let ((.cse54 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse54 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse54 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse53 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_2791 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_11) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))))) .cse28) (or .cse28 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_20 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_20) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_18) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse11)))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))))) (or .cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (let ((.cse55 (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| .cse55) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= .cse55 c_threadThread1of2ForFork0_~t~0.base))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse57 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2809 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse57 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse56 c_threadThread1of2ForFork0_~t~0.base)) (= .cse56 |c_ULTIMATE.start_main_~ts~0#1.base|)))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse57 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse6))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (= (select |c_#valid| |c_ULTIMATE.start_main_~ts~0#1.base|) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse60 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse58 (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse59 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse60 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse58 .cse59 (store (select .cse58 .cse59) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse60 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int)) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= .cse61 c_threadThread1of2ForFork0_~t~0.base) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| .cse61)))) .cse28) (or .cse28 (and (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2792 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse11)))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_20 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_20) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_18) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base)))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse62 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse62 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse63 (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse62 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse63 .cse64 (store (select .cse63 .cse64) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse2 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse65 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse65 .cse66 (store (select .cse65 .cse66) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39))))))) (or .cse28 (forall ((v_prenex_10 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (let ((.cse67 (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_10) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse67) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| .cse67))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse33 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= (select (select (let ((.cse68 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse68 .cse35 (store (select .cse68 .cse35) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20) |c_threadThread1of2ForFork0_#t~nondet4|)))) .cse28 (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse69 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse69 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse70 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse71 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse69 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse70 .cse71 (store (select .cse70 .cse71) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse72 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse72 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse73 (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse74 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse72 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse73 .cse74 (store (select .cse73 .cse74) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39))))) (<= .cse33 c_threadThread1of2ForFork0_~t~0.offset) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse75 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse75 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse76 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse77 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse75 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse76 .cse77 (store (select .cse76 .cse77) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse21))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 5)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 6)) (= (select .cse1 0) 0) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse80 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse78 (store (store .cse81 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse79 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse80 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse78 .cse79 (store (select .cse78 .cse79) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse80 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (= c_threadThread1of2ForFork0_~t~0.offset 0) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse82 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse82 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse83 (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse84 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse82 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse83 .cse84 (store (select .cse83 .cse84) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or .cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_23) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse85 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse85 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse86 (store (store .cse81 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse87 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse85 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse86 .cse87 (store (select .cse86 .cse87) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or .cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |c_ULTIMATE.start_main_~ts~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))))) (= .cse35 c_threadThread1of2ForFork0_~t~0.base) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse33 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_2817 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse88 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817))) (store .cse88 .cse35 (store (select .cse88 .cse35) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 .cse20)) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse89 (select .cse5 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse89)) (not (= .cse89 c_threadThread1of2ForFork0_~t~0.base))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse90 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_4) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse90 c_threadThread1of2ForFork0_~t~0.base)) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse90))))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (or .cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse91 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse91 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse92 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse93 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse91 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse92 .cse93 (store (select .cse92 .cse93) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or .cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_prenex_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_55| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_11) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_17) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) .cse28) (= (select .cse5 0) c_threadThread1of2ForFork0_~t~0.base) (or .cse28 (and (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse94 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (forall ((v_prenex_15 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 .cse94 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_15) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2792 .cse94 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse6))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_16 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791) |c_ULTIMATE.start_main_~ts~0#1.base| (store v_ArrVal_2791 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_16) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 .cse11)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse95 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse95 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse96 (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse97 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse95 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse96 .cse97 (store (select .cse96 .cse97) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (or (and (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_16 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_16) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.base|))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse98 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse98 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse6)) (forall ((v_prenex_15 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse98 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_15) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base)))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) .cse28) (= |c_ULTIMATE.start_main_~ts~0#1.offset| 0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 .cse6)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse99 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse99 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse100 (store (store |c_#race| |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse101 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse99 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse100 .cse101 (store (select .cse100 .cse101) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse20))))) (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse103 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_9 (Array Int Int))) (not (= (select (select (store (let ((.cse102 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse102 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse102 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse103 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_9) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (let ((.cse104 (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792))) (store .cse104 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse104 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse103 v_ArrVal_2803))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse39))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse105 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_19 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse105 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_19) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse105 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse11))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((v_ArrVal_2792 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse107 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_19 (Array Int Int))) (not (= (select (select (store (let ((.cse106 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse106 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse106 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse107 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_19) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (let ((.cse108 (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2792))) (store .cse108 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse108 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse107 v_ArrVal_2803))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse11))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (let ((.cse109 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_ArrVal_2809 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse109 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) (forall ((v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2803 Int)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse109 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) .cse20))))) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse112 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse110 (store (store .cse81 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse111 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse112 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse110 .cse111 (store (select .cse110 .cse111) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse112 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse0 7)) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse113 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse113 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse114 (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse115 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse113 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse114 .cse115 (store (select .cse114 .cse115) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse39)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2791 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (forall ((v_prenex_21 (Array Int Int))) (let ((.cse116 (select (select (store (let ((.cse117 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_2791))) (store .cse117 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse117 |c_ULTIMATE.start_main_~ts~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc7#1.base_55|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_prenex_21) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (not (= .cse116 c_threadThread1of2ForFork0_~t~0.base)) (not (= |c_ULTIMATE.start_main_~ts~0#1.base| .cse116))))))))) (forall ((v_ArrVal_2813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_55| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_2809 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_52| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2803 Int)) (let ((.cse118 (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse1 .cse118 v_ArrVal_2803)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2808) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_55|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse119 (store (store .cse81 |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2813) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_2817)) (.cse120 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse5 .cse118 |v_ULTIMATE.start_main_#t~malloc7#1.base_55|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_55| v_ArrVal_2809) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse119 .cse120 (store (select .cse119 .cse120) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_52| .cse12))))))) is different from true [2024-10-26 05:24:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 05:24:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-26 05:24:14,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-26 05:24:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-26 05:24:15,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:24:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:24:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1057703765, now seen corresponding path program 1 times [2024-10-26 05:24:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:24:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877472503] [2024-10-26 05:24:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:24:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:24:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:24:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-26 05:24:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:24:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877472503] [2024-10-26 05:24:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877472503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:24:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:24:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 05:24:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304938231] [2024-10-26 05:24:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:24:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:24:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:24:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:24:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:24:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:15,591 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:24:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-10-26 05:24:15,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 05:24:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-26 05:24:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 05:24:16,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:24:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:24:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -749750698, now seen corresponding path program 1 times [2024-10-26 05:24:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:24:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093750688] [2024-10-26 05:24:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:24:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:24:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:24:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:24:29,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:24:29,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093750688] [2024-10-26 05:24:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093750688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:24:29,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656014931] [2024-10-26 05:24:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:24:29,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:24:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:24:29,126 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:24:29,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-26 05:24:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:24:29,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-26 05:24:29,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:24:29,372 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-10-26 05:24:30,362 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:24:30,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 05:24:31,173 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 1 [2024-10-26 05:24:31,188 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-10-26 05:24:32,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:24:32,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:24:34,610 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-26 05:24:34,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-26 05:24:34,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:34,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:24:34,847 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 13 treesize of output 9 [2024-10-26 05:24:35,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 05:24:35,992 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 32 treesize of output 34 [2024-10-26 05:24:36,611 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 41 treesize of output 46 [2024-10-26 05:24:39,463 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-26 05:24:39,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-26 05:24:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:40,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-26 05:24:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:40,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-10-26 05:24:41,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:41,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:42,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:42,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:42,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-10-26 05:24:43,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 05:24:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:43,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:43,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:43,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:47,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:47,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2024-10-26 05:24:47,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 05:24:47,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:48,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:48,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:48,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 05:24:49,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2024-10-26 05:24:49,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2024-10-26 05:24:50,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,703 INFO L224 Elim1Store]: Index analysis took 119 ms [2024-10-26 05:24:50,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2024-10-26 05:24:50,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 05:24:50,924 INFO L224 Elim1Store]: Index analysis took 119 ms [2024-10-26 05:24:50,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2024-10-26 05:24:53,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2024-10-26 05:24:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:24:54,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:24:54,875 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3160 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:24:55,175 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3160 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:24:55,251 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:24:55,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_3158 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) is different from false [2024-10-26 05:24:55,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:24:56,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1) 0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_3156) .cse2 v_ArrVal_3158)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) is different from false [2024-10-26 05:24:58,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse1 .cse2 (store (store (store (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse3 .cse2 (store (store (store (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse4 .cse2 (store (store (store (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse5 .cse2 (store (store (store (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|)))))) is different from false [2024-10-26 05:24:59,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse1 .cse2 (store (store (store (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse3 .cse2 (store (store (store (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse4 .cse2 (store (store (store (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse5 .cse2 (store (store (store (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))))) is different from false [2024-10-26 05:25:01,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse1 .cse2 (store (store (store (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse3 .cse2 (store (store (store (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse4 .cse2 (store (store (store (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153))) (store .cse5 .cse2 (store (store (store (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2024-10-26 05:25:01,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2024-10-26 05:25:02,290 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse2 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse3 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:25:03,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~1#1.base|)))) (and (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= (select (select (store (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse4 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse5 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse5) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse6 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))))) is different from false [2024-10-26 05:25:03,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (and (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse0) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse4 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse5 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse5) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 Int) (v_ArrVal_3149 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse2 .cse3 v_ArrVal_3138)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3145) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3158 Int) (v_ArrVal_3156 Int) (v_ArrVal_3160 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse6 (store (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_3153) .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3156) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_3158))) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3160) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))))) is different from false [2024-10-26 05:25:27,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:27,828 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 132 treesize of output 123 [2024-10-26 05:25:27,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:27,889 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 3040 treesize of output 2783 [2024-10-26 05:25:27,962 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 3229 treesize of output 3197 [2024-10-26 05:25:28,053 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 3350 treesize of output 3314 [2024-10-26 05:25:28,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 1030 [2024-10-26 05:25:31,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:31,382 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 12827 treesize of output 10495 [2024-10-26 05:25:36,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:36,282 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 132 treesize of output 123 [2024-10-26 05:25:36,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:25:36,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:36,374 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 1434 treesize of output 1327 [2024-10-26 05:25:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3246 treesize of output 3214 [2024-10-26 05:25:36,545 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 22324 treesize of output 22064 [2024-10-26 05:25:39,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:39,131 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 13892 treesize of output 11116 [2024-10-26 05:25:42,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:42,887 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 132 treesize of output 123 [2024-10-26 05:25:42,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:25:42,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:42,963 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 1434 treesize of output 1327 [2024-10-26 05:25:43,038 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 1886 treesize of output 1870 [2024-10-26 05:25:43,147 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 11444 treesize of output 11312 [2024-10-26 05:25:45,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:45,238 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 14531 treesize of output 11627 [2024-10-26 05:25:49,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:49,013 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 132 treesize of output 123 [2024-10-26 05:25:49,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:25:49,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:49,089 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 744 treesize of output 699 [2024-10-26 05:25:49,163 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 11320 treesize of output 11188 [2024-10-26 05:25:49,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2130 treesize of output 2114 [2024-10-26 05:25:50,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:25:50,598 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 3870 treesize of output 3162 Killed by 15