/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-22 21:28:30,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-22 21:28:30,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-22 21:28:30,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-22 21:28:30,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-22 21:28:30,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-22 21:28:30,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-22 21:28:30,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-22 21:28:30,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Use SBE=true [2025-01-22 21:28:30,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-22 21:28:30,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-22 21:28:30,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 21:28:30,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-22 21:28:30,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-22 21:28:30,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-22 21:28:30,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-22 21:28:30,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-22 21:28:30,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-22 21:28:30,793 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-22 21:28:30,794 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-22 21:28:30,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl [2025-01-22 21:28:30,800 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl' [2025-01-22 21:28:30,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-22 21:28:30,833 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-22 21:28:30,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-22 21:28:30,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-22 21:28:30,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-22 21:28:30,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,869 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-22 21:28:30,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-22 21:28:30,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-22 21:28:30,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-22 21:28:30,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-22 21:28:30,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-22 21:28:30,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-22 21:28:30,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-22 21:28:30,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-22 21:28:30,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/1) ... [2025-01-22 21:28:30,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 21:28:30,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 21:28:30,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-22 21:28:30,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-22 21:28:30,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-22 21:28:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-22 21:28:30,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-22 21:28:30,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-22 21:28:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-22 21:28:30,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-22 21:28:30,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-22 21:28:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-22 21:28:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-22 21:28:30,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-22 21:28:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-22 21:28:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-22 21:28:30,941 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-22 21:28:30,978 INFO L234 CfgBuilder]: Building ICFG [2025-01-22 21:28:30,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-22 21:28:31,059 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-22 21:28:31,060 INFO L283 CfgBuilder]: Performing block encoding [2025-01-22 21:28:31,096 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-22 21:28:31,096 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-22 21:28:31,097 INFO L201 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 09:28:31 BoogieIcfgContainer [2025-01-22 21:28:31,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-22 21:28:31,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-22 21:28:31,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-22 21:28:31,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-22 21:28:31,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 09:28:30" (1/2) ... [2025-01-22 21:28:31,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55def541 and model type min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.01 09:28:31, skipping insertion in model container [2025-01-22 21:28:31,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 09:28:31" (2/2) ... [2025-01-22 21:28:31,107 INFO L128 eAbstractionObserver]: Analyzing ICFG min-array.wvr.bpl [2025-01-22 21:28:31,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-22 21:28:31,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG min-array.wvr.bpl that has 4 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-22 21:28:31,120 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-22 21:28:31,147 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-22 21:28:31,181 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 21:28:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-22 21:28:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 21:28:31,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-22 21:28:31,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-22 21:28:31,239 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-22 21:28:31,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-22 21:28:31,262 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;@31e2f32e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 21:28:31,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-22 21:28:31,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 21:28:31,589 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 21:28:31,590 INFO L139 ounterexampleChecker]: Examining path program with hash 464764640, occurence #1 [2025-01-22 21:28:31,590 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 21:28:31,590 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 21:28:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 21:28:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1490265330, now seen corresponding path program 1 times [2025-01-22 21:28:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 21:28:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716458215] [2025-01-22 21:28:31,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 21:28:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 21:28:31,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-22 21:28:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-22 21:28:31,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 21:28:31,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 21:28:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 21:28:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716458215] [2025-01-22 21:28:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716458215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 21:28:31,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 21:28:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-22 21:28:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550478495] [2025-01-22 21:28:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 21:28:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-22 21:28:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 21:28:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-22 21:28:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-22 21:28:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:31,828 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 21:28:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2025-01-22 21:28:31,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 21:28:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-22 21:28:31,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 21:28:31,906 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 21:28:31,906 INFO L139 ounterexampleChecker]: Examining path program with hash -1504241846, occurence #1 [2025-01-22 21:28:31,906 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 21:28:31,906 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 21:28:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 21:28:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1906162644, now seen corresponding path program 1 times [2025-01-22 21:28:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 21:28:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593718454] [2025-01-22 21:28:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 21:28:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 21:28:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-22 21:28:31,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-22 21:28:31,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 21:28:31,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 21:28:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:33,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 21:28:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593718454] [2025-01-22 21:28:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593718454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 21:28:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511977736] [2025-01-22 21:28:33,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 21:28:33,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 21:28:33,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 21:28:33,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 21:28:33,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-22 21:28:33,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-22 21:28:33,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-22 21:28:33,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 21:28:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 21:28:33,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-22 21:28:33,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 21:28:34,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 21:28:34,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 21:28:34,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 21:28:34,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 183 [2025-01-22 21:28:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:34,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 21:28:37,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 21:28:37,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 1131 treesize of output 609 [2025-01-22 21:28:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511977736] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 21:28:52,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 21:28:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-01-22 21:28:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834101891] [2025-01-22 21:28:52,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 21:28:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-22 21:28:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 21:28:52,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-22 21:28:52,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-01-22 21:28:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:52,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 21:28:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 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) [2025-01-22 21:28:52,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 21:28:52,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 21:28:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-22 21:28:54,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-22 21:28:54,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 21:28:54,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 21:28:54,594 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 21:28:54,594 INFO L139 ounterexampleChecker]: Examining path program with hash 264260834, occurence #1 [2025-01-22 21:28:54,594 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 21:28:54,594 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 21:28:54,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 21:28:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash -640358690, now seen corresponding path program 2 times [2025-01-22 21:28:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 21:28:54,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802315884] [2025-01-22 21:28:54,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 21:28:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 21:28:54,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-22 21:28:54,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-22 21:28:54,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 21:28:54,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 21:28:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 21:28:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802315884] [2025-01-22 21:28:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802315884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 21:28:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824157901] [2025-01-22 21:28:54,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 21:28:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 21:28:54,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 21:28:54,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 21:28:54,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-22 21:28:54,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-22 21:28:54,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-22 21:28:54,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 21:28:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 21:28:54,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-22 21:28:54,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 21:28:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:54,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 21:28:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 21:28:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824157901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 21:28:55,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 21:28:55,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 27 [2025-01-22 21:28:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031526865] [2025-01-22 21:28:55,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 21:28:55,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-22 21:28:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 21:28:55,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-22 21:28:55,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-01-22 21:28:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:55,031 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 21:28:55,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 27 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 21:28:55,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 21:28:55,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-01-22 21:28:55,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 21:28:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 21:28:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-22 21:28:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-22 21:28:55,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-22 21:28:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 21:28:55,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-22 21:28:55,651 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 21:28:55,651 INFO L139 ounterexampleChecker]: Examining path program with hash 264260834, occurence #2 [2025-01-22 21:28:55,651 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-22 21:28:55,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-01-22 21:28:55,652 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-22 21:28:55,652 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-01-22 21:28:55,652 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-22 21:28:55,652 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-01-22 21:28:55,652 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-22 21:28:55,652 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-22 21:28:55,652 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 21:28:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 21:28:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1192756316, now seen corresponding path program 3 times [2025-01-22 21:28:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 21:28:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677999916] [2025-01-22 21:28:55,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 21:28:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 21:28:55,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-01-22 21:28:55,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-01-22 21:28:55,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-22 21:28:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-01-22 21:43:10,351 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-01-22 21:43:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-22 21:43:10,351 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-6-10-5-11-5-10-5-9-5-9-5-8-4-7-4-3-4-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-26-6-11-11-11-10-10-7-8-6-8-5-8-5-7-5-7-5-6-4-3-1 context. [2025-01-22 21:43:10,355 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-22 21:43:10,355 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-22 21:43:10,355 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-22 21:43:10,362 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-22 21:43:10,366 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-22 21:43:10,367 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-22 21:43:10,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-22 21:43:10,368 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-22 21:43:10,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-22 21:43:10,380 INFO L201 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.01 09:43:10 BasicIcfg [2025-01-22 21:43:10,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-22 21:43:10,381 INFO L158 Benchmark]: Toolchain (without parser) took 879549.35ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 79.6MB in the beginning and 1.0GB in the end (delta: -925.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2025-01-22 21:43:10,382 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:43:10,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.75ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:43:10,382 INFO L158 Benchmark]: Boogie Preprocessor took 17.92ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 77.6MB in the end (delta: 698.3kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:43:10,382 INFO L158 Benchmark]: RCFGBuilder took 204.09ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 67.0MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-22 21:43:10,382 INFO L158 Benchmark]: TraceAbstraction took 879280.33ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 66.4MB in the beginning and 1.0GB in the end (delta: -938.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2025-01-22 21:43:10,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.75ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 17.92ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 77.6MB in the end (delta: 698.3kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 204.09ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 67.0MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 879280.33ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 66.4MB in the beginning and 1.0GB in the end (delta: -938.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1068, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 179, dependent conditional: 179, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 222, unknown conditional: 0, unknown unconditional: 222] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 0, Positive unconditional cache size: 222, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 651, Maximal queried relation: 0, Independence queries for same thread: 179, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 21, Number of trivial persistent sets: 11, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1068, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 179, dependent conditional: 179, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 651, independent unconditional: 238, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 889, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 889, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 267, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 889, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 222, unknown conditional: 0, unknown unconditional: 222] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 0, Positive unconditional cache size: 222, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 651, Maximal queried relation: 0, Independence queries for same thread: 179 - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-6-10-5-11-5-10-5-9-5-9-5-8-4-7-4-3-4-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-26-6-11-11-11-10-10-7-8-6-8-5-8-5-7-5-7-5-6-4-3-1 context. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-6-10-5-11-5-10-5-9-5-9-5-8-4-7-4-3-4-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-26-6-11-11-11-10-10-7-8-6-8-5-8-5-7-5-7-5-6-4-3-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-6-10-5-11-5-10-5-9-5-9-5-8-4-7-4-3-4-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-26-6-11-11-11-10-10-7-8-6-8-5-8-5-7-5-7-5-6-4-3-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-3-6-10-5-11-5-10-5-9-5-9-5-8-4-7-4-3-4-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-26-6-11-11-11-10-10-7-8-6-8-5-8-5-7-5-7-5-6-4-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 879.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 6724 SizeOfPredicates, 8 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 2, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown