./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.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.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 05:20:12,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 05:20:12,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 05:20:12,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 05:20:12,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 05:20:12,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 05:20:12,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 05:20:12,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 05:20:12,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 05:20:12,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 05:20:12,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 05:20:12,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 05:20:12,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 05:20:12,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 05:20:12,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 05:20:12,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 05:20:12,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 05:20:12,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 05:20:12,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 05:20:12,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 05:20:12,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 05:20:12,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 05:20:12,264 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 05:20:12,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 05:20:12,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 05:20:12,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 05:20:12,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 05:20:12,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 05:20:12,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 05:20:12,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 05:20:12,266 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 05:20:12,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 05:20:12,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 05:20:12,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 05:20:12,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 05:20:12,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 05:20:12,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 05:20:12,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 05:20:12,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 05:20:12,268 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 05:20:12,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 05:20:12,269 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 05:20:12,269 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 05:20:12,270 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2024-10-26 05:20:12,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 05:20:12,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 05:20:12,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 05:20:12,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 05:20:12,547 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 05:20:12,548 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.i [2024-10-26 05:20:14,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 05:20:14,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 05:20:14,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-10-26 05:20:14,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/608a393fa/e1b93f82f6614c82bf3c748aa6fcc923/FLAGad68e204e [2024-10-26 05:20:14,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/608a393fa/e1b93f82f6614c82bf3c748aa6fcc923 [2024-10-26 05:20:14,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 05:20:14,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 05:20:14,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 05:20:14,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 05:20:14,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 05:20:14,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:20:14" (1/1) ... [2024-10-26 05:20:14,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527c59bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:14, skipping insertion in model container [2024-10-26 05:20:14,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:20:14" (1/1) ... [2024-10-26 05:20:14,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 05:20:14,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 05:20:14,960 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 05:20:15,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 05:20:15,075 INFO L204 MainTranslator]: Completed translation [2024-10-26 05:20:15,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15 WrapperNode [2024-10-26 05:20:15,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 05:20:15,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 05:20:15,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 05:20:15,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 05:20:15,087 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:20:15" (1/1) ... [2024-10-26 05:20:15,102 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:20:15" (1/1) ... [2024-10-26 05:20:15,125 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-10-26 05:20:15,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 05:20:15,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 05:20:15,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 05:20:15,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 05:20:15,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 05:20:15,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 05:20:15,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 05:20:15,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 05:20:15,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (1/1) ... [2024-10-26 05:20:15,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 05:20:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:15,200 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:20:15,203 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:20:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 05:20:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 05:20:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 05:20:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 05:20:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-26 05:20:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-26 05:20:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 05:20:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 05:20:15,259 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:20:15,425 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 05:20:15,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 05:20:15,629 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 05:20:15,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 05:20:15,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 05:20:15,642 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-26 05:20:15,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:20:15 BoogieIcfgContainer [2024-10-26 05:20:15,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 05:20:15,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 05:20:15,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 05:20:15,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 05:20:15,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 05:20:14" (1/3) ... [2024-10-26 05:20:15,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bcee27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 05:20:15, skipping insertion in model container [2024-10-26 05:20:15,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:20:15" (2/3) ... [2024-10-26 05:20:15,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bcee27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 05:20:15, skipping insertion in model container [2024-10-26 05:20:15,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:20:15" (3/3) ... [2024-10-26 05:20:15,653 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2024-10-26 05:20:15,668 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 05:20:15,669 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-26 05:20:15,669 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 05:20:15,715 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 05:20:15,768 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:20:15,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:15,773 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:20:15,775 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:20:15,826 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:20:15,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-10-26 05:20:15,849 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;@59fb7aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:15,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-26 05:20:16,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -663578502, now seen corresponding path program 1 times [2024-10-26 05:20:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704649220] [2024-10-26 05:20:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:16,618 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:20:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704649220] [2024-10-26 05:20:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704649220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:16,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:16,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:20:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209474791] [2024-10-26 05:20:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:16,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:20:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:20:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:20:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:16,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:16,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:16,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 05:20:16,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -649763536, now seen corresponding path program 1 times [2024-10-26 05:20:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251654254] [2024-10-26 05:20:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:17,448 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:20:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251654254] [2024-10-26 05:20:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251654254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:20:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495511355] [2024-10-26 05:20:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:20:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:20:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:20:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:17,455 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:17,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:17,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:17,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:17,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 05:20:17,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -10252985, now seen corresponding path program 1 times [2024-10-26 05:20:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523644842] [2024-10-26 05:20:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523644842] [2024-10-26 05:20:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523644842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:20:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589728948] [2024-10-26 05:20:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:20:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:18,694 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:20:18,696 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:20:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:18,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 05:20:18,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:20:18,854 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:20:18,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:20:18,915 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:20:18,966 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:20:18,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:20:19,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:19,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:20:19,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 05:20:19,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:19,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:20:19,331 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:20:19,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 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_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:20:19,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 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_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:20:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-26 05:20:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589728948] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:20:21,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:20:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-10-26 05:20:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738151751] [2024-10-26 05:20:21,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:20:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-26 05:20:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-26 05:20:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2024-10-26 05:20:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:21,719 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 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:21,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:21,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:21,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:20:25,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-26 05:20:25,370 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:20:25,555 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:20:25,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-26 05:20:25,574 INFO L312 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-10-26 05:20:25,580 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:25,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:20:25,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:25,584 INFO L229 MonitoredProcess]: Starting monitored process 4 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:20:25,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-26 05:20:25,588 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:20:25,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 05:20:25,589 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;@59fb7aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:25,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-26 05:20:25,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-26 05:20:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash -998780506, now seen corresponding path program 1 times [2024-10-26 05:20:25,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:25,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179121022] [2024-10-26 05:20:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:25,627 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:20:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179121022] [2024-10-26 05:20:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179121022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:25,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:20:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732294444] [2024-10-26 05:20:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:20:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:20:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:20:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,631 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:25,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 05:20:25,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-26 05:20:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1690337444, now seen corresponding path program 1 times [2024-10-26 05:20:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62230651] [2024-10-26 05:20:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:25,833 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:20:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62230651] [2024-10-26 05:20:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62230651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:25,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:20:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103614410] [2024-10-26 05:20:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:25,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:20:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:20:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:20:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:25,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:25,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:25,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 05:20:25,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-26 05:20:25,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash 225505610, now seen corresponding path program 1 times [2024-10-26 05:20:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731293178] [2024-10-26 05:20:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 05:20:25,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 05:20:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 05:20:26,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 05:20:26,043 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 05:20:26,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-26 05:20:26,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2024-10-26 05:20:26,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2024-10-26 05:20:26,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 05:20:26,051 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-26 05:20:26,052 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-10-26 05:20:26,052 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 05:20:26,052 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 05:20:26,065 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 05:20:26,070 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 05:20:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:26,074 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20:26,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-26 05:20:26,079 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 05:20:26,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-10-26 05:20:26,079 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;@59fb7aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 05:20:26,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-26 05:20:26,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:26,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -366340535, now seen corresponding path program 1 times [2024-10-26 05:20:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300883916] [2024-10-26 05:20:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:26,327 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:20:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300883916] [2024-10-26 05:20:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300883916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:26,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 05:20:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307390047] [2024-10-26 05:20:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:26,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 05:20:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 05:20:26,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 05:20:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:26,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:26,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:26,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:26,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 05:20:26,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:26,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 652159709, now seen corresponding path program 1 times [2024-10-26 05:20:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049076303] [2024-10-26 05:20:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:26,597 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:20:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049076303] [2024-10-26 05:20:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049076303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 05:20:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590081984] [2024-10-26 05:20:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:20:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:20:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:20:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:26,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:26,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:26,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:26,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:27,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 05:20:27,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 57226996, now seen corresponding path program 1 times [2024-10-26 05:20:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768274260] [2024-10-26 05:20:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768274260] [2024-10-26 05:20:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768274260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:20:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527930564] [2024-10-26 05:20:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:20:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:28,453 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:20:28,454 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:20:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:28,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-26 05:20:28,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:20:28,552 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:20:28,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:20:28,565 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:20:28,591 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:20:28,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:20:28,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:28,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:20:28,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:28,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 05:20:28,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:28,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:20:28,806 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:20:28,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-10-26 05:20:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-26 05:20:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527930564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:20:32,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:20:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-10-26 05:20:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707977656] [2024-10-26 05:20:32,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:20:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-26 05:20:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-26 05:20:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=9, NotChecked=62, Total=342 [2024-10-26 05:20:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:32,888 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:32,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 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:32,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:32,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:32,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:20:35,200 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:20:35,381 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,SelfDestructingSolverStorable8 [2024-10-26 05:20:35,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -587838036, now seen corresponding path program 1 times [2024-10-26 05:20:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545799105] [2024-10-26 05:20:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-26 05:20:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545799105] [2024-10-26 05:20:35,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545799105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 05:20:35,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 05:20:35,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 05:20:35,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499515720] [2024-10-26 05:20:35,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 05:20:35,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 05:20:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 05:20:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 05:20:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:35,806 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 05:20:35,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:35,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:35,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:20:35,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:20:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 05:20:37,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -266507489, now seen corresponding path program 1 times [2024-10-26 05:20:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347144517] [2024-10-26 05:20:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347144517] [2024-10-26 05:20:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347144517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:20:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073898445] [2024-10-26 05:20:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:38,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:20:38,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:38,177 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:20:38,178 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:20:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:38,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-26 05:20:38,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:20:38,290 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:20:38,346 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:20:38,346 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:20:38,521 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:20:38,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:20:38,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:20:38,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:38,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 05:20:38,816 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:20:38,816 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:20:38,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:38,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:38,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:39,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:20:39,447 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-10-26 05:20:39,608 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-10-26 05:20:39,646 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:20:39,895 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-10-26 05:20:40,037 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-10-26 05:20:42,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,884 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 36 treesize of output 52 [2024-10-26 05:20:42,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,895 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 122 treesize of output 60 [2024-10-26 05:20:42,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 22 [2024-10-26 05:20:42,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-26 05:20:42,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-10-26 05:20:42,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:20:42,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,946 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 76 treesize of output 32 [2024-10-26 05:20:42,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,964 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 38 treesize of output 54 [2024-10-26 05:20:42,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:20:42,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,969 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 84 treesize of output 32 [2024-10-26 05:20:42,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,983 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 38 treesize of output 54 [2024-10-26 05:20:42,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:20:42,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:42,996 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 68 treesize of output 28 [2024-10-26 05:20:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 47 not checked. [2024-10-26 05:20:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073898445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:20:45,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:20:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2024-10-26 05:20:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707433807] [2024-10-26 05:20:45,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:20:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-26 05:20:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:20:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-26 05:20:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1824, Unknown=37, NotChecked=460, Total=2550 [2024-10-26 05:20:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:45,433 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:20:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 4.76) internal successors, (238), 51 states have internal predecessors, (238), 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:45,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:45,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:45,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 05:20:45,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:45,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:20:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:20:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:20:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-26 05:20:52,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-26 05:20:52,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:20:52,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:20:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:20:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1687412563, now seen corresponding path program 2 times [2024-10-26 05:20:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:20:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279172328] [2024-10-26 05:20:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:20:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:20:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:20:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:20:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279172328] [2024-10-26 05:20:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279172328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:20:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79653073] [2024-10-26 05:20:53,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:20:53,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:20:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:20:53,485 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:20:53,485 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:20:53,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:20:53,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:20:53,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-26 05:20:53,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:20:53,598 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:20:53,641 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:20:53,642 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:20:53,861 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:20:53,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:20:53,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:53,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:20:54,097 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:20:54,098 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:20:54,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 34 treesize of output 25 [2024-10-26 05:20:54,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:54,314 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 39 treesize of output 44 [2024-10-26 05:20:54,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:20:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:20:54,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:20:54,822 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-10-26 05:20:54,869 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:20:55,304 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-10-26 05:20:55,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2024-10-26 05:20:55,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:20:55,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse0))))) is different from false [2024-10-26 05:20:57,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,763 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 81 treesize of output 91 [2024-10-26 05:20:57,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,769 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 137 treesize of output 79 [2024-10-26 05:20:57,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:57,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:57,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:20:57,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,803 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 47 treesize of output 57 [2024-10-26 05:20:57,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,810 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 75 treesize of output 41 [2024-10-26 05:20:57,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:20:57,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,824 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 43 treesize of output 53 [2024-10-26 05:20:57,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:20:57,830 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 65 treesize of output 37 [2024-10-26 05:20:57,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2024-10-26 05:21:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79653073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:00,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 51 [2024-10-26 05:21:00,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748185090] [2024-10-26 05:21:00,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:00,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 05:21:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 05:21:00,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1820, Unknown=66, NotChecked=558, Total=2652 [2024-10-26 05:21:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:00,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.666666666666667) internal successors, (238), 52 states have internal predecessors, (238), 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:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-10-26 05:21:00,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:04,935 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:21:05,117 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,SelfDestructingSolverStorable11 [2024-10-26 05:21:05,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:05,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1299880376, now seen corresponding path program 2 times [2024-10-26 05:21:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:05,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653933272] [2024-10-26 05:21:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-26 05:21:05,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653933272] [2024-10-26 05:21:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653933272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582347690] [2024-10-26 05:21:05,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:21:05,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:05,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:05,622 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:21:05,623 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:21:05,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:21:05,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:21:05,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-26 05:21:05,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:05,734 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:21:05,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 05:21:05,763 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:21:05,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-26 05:21:05,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-26 05:21:05,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-26 05:21:05,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:05,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-26 05:21:05,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:05,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-26 05:21:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-26 05:21:05,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:05,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_690) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) |c_ULTIMATE.start_main_#t~nondet9#1|)) is different from false [2024-10-26 05:21:05,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:05,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-26 05:21:05,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-26 05:21:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-26 05:21:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582347690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:06,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:06,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 20 [2024-10-26 05:21:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388567747] [2024-10-26 05:21:06,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 05:21:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:06,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 05:21:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2024-10-26 05:21:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:06,040 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:06,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.45) 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:21:06,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:06,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:06,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:06,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:06,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:06,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:06,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:06,980 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:21:07,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:07,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -864983549, now seen corresponding path program 3 times [2024-10-26 05:21:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192421205] [2024-10-26 05:21:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:08,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192421205] [2024-10-26 05:21:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192421205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872931785] [2024-10-26 05:21:08,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 05:21:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:08,207 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:21:08,209 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:21:08,411 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 05:21:08,411 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:21:08,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-26 05:21:08,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:08,422 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:21:08,486 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:21:08,487 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:21:08,680 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:21:08,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:21:08,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:21:08,886 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:21:08,886 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:21:09,002 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 34 treesize of output 25 [2024-10-26 05:21:09,012 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 34 treesize of output 25 [2024-10-26 05:21:09,024 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 34 treesize of output 25 [2024-10-26 05:21:09,043 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 34 treesize of output 25 [2024-10-26 05:21:09,290 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 34 treesize of output 25 [2024-10-26 05:21:09,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:09,305 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 39 treesize of output 44 [2024-10-26 05:21:09,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 43 treesize of output 32 [2024-10-26 05:21:09,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:21:09,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:21:09,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 05:21:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:09,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:09,473 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:21:09,595 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-10-26 05:21:09,619 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-10-26 05:21:09,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-10-26 05:21:09,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:21:10,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-10-26 05:21:11,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 17 treesize of output 13 [2024-10-26 05:21:11,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:11,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:11,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,257 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 47 treesize of output 57 [2024-10-26 05:21:11,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,264 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 75 treesize of output 41 [2024-10-26 05:21:11,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:11,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,279 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 47 treesize of output 57 [2024-10-26 05:21:11,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,285 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 91 treesize of output 45 [2024-10-26 05:21:11,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:11,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,299 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 43 treesize of output 53 [2024-10-26 05:21:11,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:11,306 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 85 treesize of output 41 [2024-10-26 05:21:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 47 not checked. [2024-10-26 05:21:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872931785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:12,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 51 [2024-10-26 05:21:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227015307] [2024-10-26 05:21:12,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 05:21:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 05:21:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1819, Unknown=67, NotChecked=558, Total=2652 [2024-10-26 05:21:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:12,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:12,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.666666666666667) internal successors, (238), 52 states have internal predecessors, (238), 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:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:12,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:16,350 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:21:16,534 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,SelfDestructingSolverStorable13 [2024-10-26 05:21:16,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1135373735, now seen corresponding path program 4 times [2024-10-26 05:21:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691500943] [2024-10-26 05:21:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691500943] [2024-10-26 05:21:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691500943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092749716] [2024-10-26 05:21:17,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 05:21:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:17,473 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:21:17,474 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:21:17,810 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 05:21:17,810 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:21:17,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-26 05:21:17,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:17,821 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:21:17,868 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:21:17,869 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:21:18,137 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:21:18,181 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:21:18,238 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:21:18,435 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:21:18,435 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:21:18,659 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 30 treesize of output 21 [2024-10-26 05:21:18,673 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 30 treesize of output 21 [2024-10-26 05:21:18,703 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 30 treesize of output 21 [2024-10-26 05:21:18,719 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 30 treesize of output 21 [2024-10-26 05:21:19,070 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 30 treesize of output 21 [2024-10-26 05:21:19,081 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 30 treesize of output 21 [2024-10-26 05:21:19,098 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 30 treesize of output 21 [2024-10-26 05:21:19,118 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 30 treesize of output 21 [2024-10-26 05:21:19,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 05:21:19,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:19,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 05:21:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:19,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:19,995 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27)))) is different from false [2024-10-26 05:21:20,457 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27)))) is different from false [2024-10-26 05:21:20,709 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-10-26 05:21:21,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,593 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 59 treesize of output 52 [2024-10-26 05:21:21,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,603 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 394 treesize of output 346 [2024-10-26 05:21:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2024-10-26 05:21:21,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 105 [2024-10-26 05:21:21,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2024-10-26 05:21:21,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,831 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 192 treesize of output 176 [2024-10-26 05:21:21,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:21,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-10-26 05:21:21,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2024-10-26 05:21:21,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:21,945 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 314 treesize of output 282 [2024-10-26 05:21:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2024-10-26 05:21:21,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-10-26 05:21:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2024-10-26 05:21:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092749716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:22,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2024-10-26 05:21:22,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058979301] [2024-10-26 05:21:22,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:22,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-26 05:21:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-26 05:21:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2312, Unknown=15, NotChecked=300, Total=2862 [2024-10-26 05:21:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:22,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:22,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.6415094339622645) internal successors, (246), 54 states have internal predecessors, (246), 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:21:22,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:22,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:22,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-26 05:21:22,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-26 05:21:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 05:21:33,198 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:21:33,384 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,SelfDestructingSolverStorable14 [2024-10-26 05:21:33,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 328040159, now seen corresponding path program 5 times [2024-10-26 05:21:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994185342] [2024-10-26 05:21:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994185342] [2024-10-26 05:21:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994185342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856457315] [2024-10-26 05:21:34,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 05:21:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:34,314 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:21:34,316 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:21:34,458 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-26 05:21:34,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:21:34,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-26 05:21:34,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:34,472 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:21:34,518 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:21:34,518 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:21:34,719 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:21:34,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 05:21:34,869 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:21:34,869 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:21:34,985 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:21:35,004 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:21:35,071 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:21:35,130 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:21:35,145 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:21:35,156 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:21:35,448 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:21:35,469 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:21:35,489 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:21:35,508 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:21:35,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:21:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:35,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:35,722 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:21:35,760 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:21:35,773 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-10-26 05:21:35,802 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2024-10-26 05:21:36,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2024-10-26 05:21:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:39,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:39,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:39,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:39,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:39,101 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 38 treesize of output 43 [2024-10-26 05:21:39,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:39,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2024-10-26 05:21:39,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:39,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:39,116 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 42 treesize of output 47 [2024-10-26 05:21:39,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:39,125 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 59 treesize of output 37 [2024-10-26 05:21:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2024-10-26 05:21:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856457315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:39,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 55 [2024-10-26 05:21:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401893898] [2024-10-26 05:21:39,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-26 05:21:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-26 05:21:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2243, Unknown=102, NotChecked=510, Total=3080 [2024-10-26 05:21:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:39,573 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:39,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.490909090909091) internal successors, (247), 56 states have internal predecessors, (247), 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:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:39,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:39,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-26 05:21:39,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 05:21:39,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-10-26 05:21:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:21:44,300 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:21:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:44,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1150469173, now seen corresponding path program 6 times [2024-10-26 05:21:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145419913] [2024-10-26 05:21:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145419913] [2024-10-26 05:21:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145419913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612382177] [2024-10-26 05:21:45,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 05:21:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:45,411 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:21:45,412 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:21:45,570 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-26 05:21:45,570 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:21:45,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-26 05:21:45,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:45,583 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:21:45,621 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:21:45,621 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:21:45,873 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:21:45,911 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:21:46,052 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:21:46,052 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:21:46,189 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:21:46,206 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:21:46,256 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 30 treesize of output 21 [2024-10-26 05:21:46,272 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 30 treesize of output 21 [2024-10-26 05:21:46,292 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 30 treesize of output 21 [2024-10-26 05:21:46,546 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 30 treesize of output 21 [2024-10-26 05:21:46,556 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:21:46,603 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:21:46,620 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:21:46,634 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:21:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 05:21:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:46,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:47,014 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-10-26 05:21:47,035 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-10-26 05:21:47,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2024-10-26 05:21:47,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2024-10-26 05:21:47,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-10-26 05:21:47,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2024-10-26 05:21:47,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:21:47,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0))))) is different from false [2024-10-26 05:21:47,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 28 treesize of output 20 [2024-10-26 05:21:47,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:47,910 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:47,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:47,918 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 53 treesize of output 58 [2024-10-26 05:21:47,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:47,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2024-10-26 05:21:47,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:47,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:47,936 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 59 treesize of output 64 [2024-10-26 05:21:47,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:47,940 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 59 treesize of output 37 [2024-10-26 05:21:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 47 not checked. [2024-10-26 05:21:50,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612382177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:50,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:50,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 55 [2024-10-26 05:21:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141803957] [2024-10-26 05:21:50,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:50,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-26 05:21:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-26 05:21:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2044, Unknown=46, NotChecked=792, Total=3080 [2024-10-26 05:21:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:50,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:50,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.4363636363636365) internal successors, (244), 56 states have internal predecessors, (244), 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:21:50,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:50,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:50,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:50,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:50,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:21:50,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:21:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-26 05:21:55,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-26 05:21:55,717 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,SelfDestructingSolverStorable16 [2024-10-26 05:21:55,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:21:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:21:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash 880078987, now seen corresponding path program 7 times [2024-10-26 05:21:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:21:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343592697] [2024-10-26 05:21:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:21:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:21:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:21:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343592697] [2024-10-26 05:21:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343592697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:21:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023779146] [2024-10-26 05:21:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-26 05:21:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:21:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:21:56,533 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:21:56,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 05:21:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:21:56,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-26 05:21:56,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:21:56,662 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:21:56,681 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:21:56,681 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:21:56,834 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:21:56,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 05:21:56,965 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:21:56,965 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:21:57,067 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 25 treesize of output 18 [2024-10-26 05:21:57,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 05:21:57,114 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 34 treesize of output 25 [2024-10-26 05:21:57,127 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 34 treesize of output 25 [2024-10-26 05:21:57,140 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 34 treesize of output 25 [2024-10-26 05:21:57,372 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 34 treesize of output 25 [2024-10-26 05:21:57,391 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 34 treesize of output 25 [2024-10-26 05:21:57,402 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 34 treesize of output 25 [2024-10-26 05:21:57,414 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 34 treesize of output 25 [2024-10-26 05:21:57,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 05:21:57,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:57,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 05:21:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:21:57,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:21:57,696 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-10-26 05:21:57,788 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-26 05:21:57,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:21:57,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-10-26 05:21:58,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:58,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:58,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:58,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:58,334 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 42 treesize of output 47 [2024-10-26 05:21:58,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:58,339 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 59 treesize of output 37 [2024-10-26 05:21:58,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 05:21:58,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:58,346 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 38 treesize of output 43 [2024-10-26 05:21:58,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:21:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2024-10-26 05:21:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2024-10-26 05:21:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023779146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:21:59,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:21:59,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 47 [2024-10-26 05:21:59,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430853156] [2024-10-26 05:21:59,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:21:59,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-26 05:21:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:21:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-26 05:21:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=102, NotChecked=348, Total=2256 [2024-10-26 05:21:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:59,174 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:21:59,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.914893617021277) internal successors, (231), 48 states have internal predecessors, (231), 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:21:59,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:21:59,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:21:59,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-10-26 05:21:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-26 05:22:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:22:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:22:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-26 05:22:04,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-26 05:22:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-26 05:22:04,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 05:22:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 05:22:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1318713277, now seen corresponding path program 8 times [2024-10-26 05:22:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 05:22:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729147867] [2024-10-26 05:22:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 05:22:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 05:22:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 05:22:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:22:05,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 05:22:05,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729147867] [2024-10-26 05:22:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729147867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 05:22:05,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844594328] [2024-10-26 05:22:05,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 05:22:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 05:22:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 05:22:05,291 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 05:22:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-26 05:22:05,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 05:22:05,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 05:22:05,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-26 05:22:05,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 05:22:05,537 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:22:05,632 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 05:22:05,632 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:22:05,973 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:22:06,021 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:22:06,299 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 05:22:06,299 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:22:06,488 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:22:06,517 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:22:06,525 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:22:06,555 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:22:06,985 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:22:07,003 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:22:07,066 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:22:07,136 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 45 treesize of output 53 [2024-10-26 05:22:07,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-10-26 05:22:07,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-10-26 05:22:11,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-10-26 05:22:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 05:22:17,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 05:22:39,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 2)) (.cse5 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 3)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse1 (store (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse2 c_threadThread1of2ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse9 (store (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse10 c_threadThread1of2ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse8 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse8 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse11 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse12 (store (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse13 c_threadThread1of2ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse11 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse11 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse14 (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse15 (store (store (select .cse16 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse16 c_threadThread1of2ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse14 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse14 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35)))))) is different from false [2024-10-26 05:24:18,645 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-10-26 05:24:18,646 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 2262 treesize of output 1923 [2024-10-26 05:24:18,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:24:18,678 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 765 treesize of output 681 [2024-10-26 05:24:18,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14576 treesize of output 14494 [2024-10-26 05:24:19,277 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-10-26 05:24:19,278 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 2946 treesize of output 2591 [2024-10-26 05:24:19,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:24:19,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 707 treesize of output 635 [2024-10-26 05:24:19,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20362 treesize of output 20234 [2024-10-26 05:24:19,978 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-10-26 05:24:19,978 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 3362 treesize of output 2799 [2024-10-26 05:24:20,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 05:24:20,017 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 763 treesize of output 687 [2024-10-26 05:24:20,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1250 treesize of output 1230 [2024-10-26 05:24:20,917 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-10-26 05:24:20,917 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 2946 treesize of output 2578 [2024-10-26 05:24:20,941 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 696 treesize of output 618 [2024-10-26 05:24:20,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 11802 treesize of output 11770 [2024-10-26 05:24:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-10-26 05:24:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844594328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 05:24:40,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 05:24:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 28] total 73 [2024-10-26 05:24:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897053865] [2024-10-26 05:24:40,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 05:24:40,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-10-26 05:24:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 05:24:40,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-10-26 05:24:40,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4829, Unknown=35, NotChecked=142, Total=5402 [2024-10-26 05:24:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:40,875 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 05:24:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 74 states have internal predecessors, (253), 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:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:24:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 05:24:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 05:24:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:24:40,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-10-26 05:24:40,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 05:25:51,110 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:25:56,381 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:25:58,386 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:27:04,724 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse87 (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse33 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse24 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_65| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_65|) 0)))) (.cse25 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|))) (.cse30 (* |c_ULTIMATE.start_main_~tids~0#1.offset| 3)) (.cse29 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse31 (* (- 1) |c_ULTIMATE.start_main_~tids~0#1.offset|))) (let ((.cse26 (let ((.cse91 (div (+ .cse31 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse91 1)) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4) 0)) (< .cse91 .cse29)))) (.cse27 (let ((.cse90 (div (+ .cse31 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse90 1)) (< .cse90 .cse29) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) (.cse32 (select |c_#race| c_threadThread1of2ForFork0_~t~0.base)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse41 (or .cse24 .cse25)) (.cse42 (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (.cse73 (or .cse24 .cse33)) (.cse68 (not (= .cse87 0))) (.cse34 (let ((.cse89 (div (+ .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4))) (or (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse89 1)) (< .cse89 .cse29)))) (.cse36 (let ((.cse88 (div (+ .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse88 1)) (< .cse88 .cse29) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0))))) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse2 (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse3 c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse7 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse8 (store (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse9 c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse7 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse7 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= (select (select (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse13 (store (store (select .cse14 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse15 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse14 c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse12 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse12 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse16 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse17 (store (store (select .cse18 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse19 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse18 c_threadThread1of2ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse16 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11)))) (= (select |c_#valid| c_threadThread1of2ForFork0_~arg.base) 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~arg.base)) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse20 (let ((.cse22 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse21 (store (store (select .cse22 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse21) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse23 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse22 c_threadThread1of2ForFork0_~t~0.base .cse21) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse20 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse20 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse24 .cse25 (and .cse26 .cse27 (let ((.cse28 (div (+ .cse31 2 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< .cse28 .cse29) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse28 1)) (not (= (mod (+ 2 .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0)))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse32 1)) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread1of2ForFork0_#in~arg.base|)) (or .cse24 .cse33 (and .cse34 (let ((.cse35 (div (+ (- 1) .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< .cse35 .cse29) (not (= (mod (+ 3 .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse35 1)))) .cse36)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse37 (let ((.cse39 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse38 (store (store (select .cse39 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse38) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse40 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse39 c_threadThread1of2ForFork0_~t~0.base .cse38) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse37 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or (and (or (< 0 |c_ULTIMATE.start_main_~t~1#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~1#1.base|) 0))) .cse41) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= (select (select (let ((.cse43 (let ((.cse45 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse44 (store (store (select .cse45 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse44) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse46 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse45 c_threadThread1of2ForFork0_~t~0.base .cse44) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse43 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse43 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse47 (let ((.cse49 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse48 (store (store (select .cse49 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse48) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse50 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse49 c_threadThread1of2ForFork0_~t~0.base .cse48) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse47 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse47 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (<= 0 |c_ULTIMATE.start_main_~tids~0#1.offset|) (or .cse24 (and .cse26 .cse27 (let ((.cse51 (div (+ (- 1) .cse31 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse51 1)) (< .cse51 .cse29) (not (= (mod (+ 3 .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) .cse25) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse32 0)) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| .cse0) (let ((.cse67 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse55 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 1)) (.cse56 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 2)) (.cse57 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse52 (let ((.cse54 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse53 (store (store (select .cse54 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse53) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse54 c_threadThread1of2ForFork0_~t~0.base .cse53) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse52 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse52 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse58 (let ((.cse60 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse59 (store (store (select .cse60 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse59) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse60 c_threadThread1of2ForFork0_~t~0.base .cse59) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse58 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse58 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse61 (let ((.cse63 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse62 (store (store (select .cse63 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse62) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse63 c_threadThread1of2ForFork0_~t~0.base .cse62) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse61 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse61 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse64 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse65 (store (store (select .cse66 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse65) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse66 c_threadThread1of2ForFork0_~t~0.base .cse65) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse64 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse64 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))))))) (or (and (or .cse25 .cse68) .cse41) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse69 (let ((.cse71 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse70 (store (store (select .cse71 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse70) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse72 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse71 c_threadThread1of2ForFork0_~t~0.base .cse70) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse69 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse69 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (or (and .cse73 (or (< 0 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 0)))) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse74 (let ((.cse76 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse75 (store (store (select .cse76 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse75) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse77 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse76 c_threadThread1of2ForFork0_~t~0.base .cse75) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse74 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse74 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse42 (and .cse73 (or .cse33 .cse68))) (= c_threadThread1of2ForFork0_~t~0.offset 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= c_threadThread1of2ForFork0_~arg.offset 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse78 (let ((.cse80 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse79 (store (store (select .cse80 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse79) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse81 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse80 c_threadThread1of2ForFork0_~t~0.base .cse79) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse78 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse78 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (or .cse24 .cse33 (and (let ((.cse82 (div (+ .cse31 2 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (not (= 0 (mod (+ 2 .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (< .cse82 .cse29) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse82 1)))) .cse34 .cse36)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse83 (let ((.cse85 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse84 (store (store (select .cse85 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse84) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse86 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse85 c_threadThread1of2ForFork0_~t~0.base .cse84) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse83 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse83 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (= (select |c_#valid| |c_threadThread1of2ForFork0_#in~arg.base|) 1) (= .cse87 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~t~0.base)) (= (select |c_#valid| c_threadThread1of2ForFork0_~t~0.base) 1)))) is different from true [2024-10-26 05:27:10,888 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:27:16,551 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:27:18,557 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:27:32,718 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:27:36,083 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:27:39,799 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:27:47,218 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse55 (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse25 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse16 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_65| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_65|) 0)))) (.cse17 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|))) (.cse22 (* |c_ULTIMATE.start_main_~tids~0#1.offset| 3)) (.cse21 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (* (- 1) |c_ULTIMATE.start_main_~tids~0#1.offset|))) (let ((.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse18 (let ((.cse59 (div (+ .cse23 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse59 1)) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4) 0)) (< .cse59 .cse21)))) (.cse19 (let ((.cse58 (div (+ .cse23 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse58 1)) (< .cse58 .cse21) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) (.cse24 (select |c_#race| c_threadThread1of2ForFork0_~t~0.base)) (.cse33 (or .cse16 .cse17)) (.cse34 (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (.cse41 (or .cse16 .cse25)) (.cse40 (not (= .cse55 0))) (.cse26 (let ((.cse57 (div (+ .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4))) (or (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse57 1)) (< .cse57 .cse21)))) (.cse28 (let ((.cse56 (div (+ .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse56 1)) (< .cse56 .cse21) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0))))) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_threadThread2of2ForFork0_#in~arg.offset| 0) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread2of2ForFork0_#in~arg.base|)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse2 (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse3 c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse8 (store (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse9 c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse7 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11)))) (= (select |c_#valid| c_threadThread1of2ForFork0_~arg.base) 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~arg.base)) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse13 (store (store (select .cse14 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse15 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse14 c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse12 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse16 .cse17 (and .cse18 .cse19 (let ((.cse20 (div (+ .cse23 2 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< .cse20 .cse21) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse20 1)) (not (= (mod (+ 2 .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0)))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse24 1)) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread1of2ForFork0_#in~arg.base|)) (or .cse16 .cse25 (and .cse26 (let ((.cse27 (div (+ (- 1) .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< .cse27 .cse21) (not (= (mod (+ 3 .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse27 1)))) .cse28)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse29 (let ((.cse31 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse30 (store (store (select .cse31 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse30) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse32 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse31 c_threadThread1of2ForFork0_~t~0.base .cse30) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse29 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or (and (or (< 0 |c_ULTIMATE.start_main_~t~1#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~1#1.base|) 0))) .cse33) .cse34) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= (select (select (let ((.cse35 (let ((.cse37 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse36 (store (store (select .cse37 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse36) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse38 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse37 c_threadThread1of2ForFork0_~t~0.base .cse36) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse35 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse35 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (<= 0 |c_ULTIMATE.start_main_~tids~0#1.offset|) (or .cse16 (and .cse18 .cse19 (let ((.cse39 (div (+ (- 1) .cse23 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse39 1)) (< .cse39 .cse21) (not (= (mod (+ 3 .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) .cse17) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse24 0)) (not (= |c_threadThread2of2ForFork0_#in~arg.base| c_threadThread1of2ForFork0_~t~0.base)) (or (and (or .cse17 .cse40) .cse33) .cse34) (or (and .cse41 (or (< 0 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 0)))) .cse34) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse42 (let ((.cse44 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse43 (store (store (select .cse44 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse43) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse45 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse44 c_threadThread1of2ForFork0_~t~0.base .cse43) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse42 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse42 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse34 (and .cse41 (or .cse25 .cse40))) (= c_threadThread1of2ForFork0_~t~0.offset 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= c_threadThread1of2ForFork0_~arg.offset 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse46 (let ((.cse48 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse47 (store (store (select .cse48 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse47) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse49 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse48 c_threadThread1of2ForFork0_~t~0.base .cse47) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse46 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse46 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (or .cse16 .cse25 (and (let ((.cse50 (div (+ .cse23 2 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (not (= 0 (mod (+ 2 .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (< .cse50 .cse21) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse50 1)))) .cse26 .cse28)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse51 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse52 (store (store (select .cse53 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse52) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse54 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse53 c_threadThread1of2ForFork0_~t~0.base .cse52) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse51 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (= (select |c_#valid| |c_threadThread1of2ForFork0_#in~arg.base|) 1) (= .cse55 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~t~0.base)) (= (select |c_#valid| c_threadThread1of2ForFork0_~t~0.base) 1)))) is different from true [2024-10-26 05:27:52,647 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:27:54,815 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:28:01,358 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:28:03,361 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:28:05,372 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:28:07,528 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:28:13,738 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:28:15,834 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:28:17,843 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:28:48,154 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:28:50,376 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:28:52,693 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:28:54,868 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:28:57,403 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:28:59,514 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:29:03,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:29:09,872 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:29:12,395 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:29:15,840 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:29:17,939 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:29:20,091 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:29:22,095 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:29:24,244 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:29:27,470 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:29:35,675 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:29:42,527 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:29:55,308 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:29:57,846 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:30:01,617 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:30:06,247 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:30:08,259 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:30:10,265 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:30:12,273 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:30:14,281 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:30:16,293 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:30:18,298 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:30:47,311 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:30:49,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 [0] [2024-10-26 05:30:58,205 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:31:00,213 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:31:02,222 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:31:05,386 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:31:07,536 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:31:09,684 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:31:11,783 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:31:13,797 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:31:15,960 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:31:17,976 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:31:20,188 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:31:22,209 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:31:24,332 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:31:26,340 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:31:32,561 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:31:34,565 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:31:37,569 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:32:01,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:32:03,768 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:32:12,064 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:32:14,280 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:32:16,813 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:32:19,022 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:32:21,226 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:32:23,342 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:32:25,484 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:32:27,508 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:32:30,537 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:32:32,543 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:32:34,661 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:32:38,903 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:32:40,908 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:32:43,005 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:32:45,105 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:32:47,116 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:32:49,124 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:32:51,129 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:33:01,396 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:33:03,401 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:33:05,407 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:33:07,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:33:09,418 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:33:11,426 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:33:13,433 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:33:15,436 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:33:17,443 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:33:19,453 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:33:25,704 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:33:27,717 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:33:29,728 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:33:31,732 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:33:33,741 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:33:35,891 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:33: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:33:39,914 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:33:41,923 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:33:43,929 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:33:45,936 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:33:47,944 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:33:49,954 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:33:51,967 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:33:53,976 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:33:55,990 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:33:58,002 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:34:00,011 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:34:02,022 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:34:04,026 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:34:06,034 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:34:08,043 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] Killed by 15