/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 NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-30 00:32:34,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-30 00:32:35,022 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-30 00:32:35,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-30 00:32:35,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-30 00:32:35,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-30 00:32:35,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-30 00:32:35,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-30 00:32:35,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-30 00:32:35,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-30 00:32:35,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * Use SBE=true [2025-01-30 00:32:35,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-30 00:32:35,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-30 00:32:35,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:32:35,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-30 00:32:35,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-30 00:32:35,055 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-30 00:32:35,055 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 -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-30 00:32:35,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-30 00:32:35,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-30 00:32:35,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-30 00:32:35,297 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-30 00:32:35,299 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-30 00:32:35,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-2.wvr.bpl [2025-01-30 00:32:35,300 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-2.wvr.bpl' [2025-01-30 00:32:35,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-30 00:32:35,318 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-30 00:32:35,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-30 00:32:35,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-30 00:32:35,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-30 00:32:35,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,340 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-30 00:32:35,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-30 00:32:35,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-30 00:32:35,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-30 00:32:35,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-30 00:32:35,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-30 00:32:35,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-30 00:32:35,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-30 00:32:35,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-30 00:32:35,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/1) ... [2025-01-30 00:32:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:32:35,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:32:35,388 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-30 00:32:35,391 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-30 00:32:35,412 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-30 00:32:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-30 00:32:35,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-30 00:32:35,412 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-30 00:32:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-30 00:32:35,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-30 00:32:35,413 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-30 00:32:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-30 00:32:35,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-30 00:32:35,413 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-30 00:32:35,452 INFO L234 CfgBuilder]: Building ICFG [2025-01-30 00:32:35,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-30 00:32:35,543 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-30 00:32:35,543 INFO L283 CfgBuilder]: Performing block encoding [2025-01-30 00:32:35,556 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-30 00:32:35,557 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-30 00:32:35,557 INFO L201 PluginConnector]: Adding new model bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:32:35 BoogieIcfgContainer [2025-01-30 00:32:35,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-30 00:32:35,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-30 00:32:35,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-30 00:32:35,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-30 00:32:35,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:32:35" (1/2) ... [2025-01-30 00:32:35,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5a78ea and model type bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:32:35, skipping insertion in model container [2025-01-30 00:32:35,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:32:35" (2/2) ... [2025-01-30 00:32:35,566 INFO L128 eAbstractionObserver]: Analyzing ICFG bakery-2.wvr.bpl [2025-01-30 00:32:35,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-30 00:32:35,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bakery-2.wvr.bpl that has 3 procedures, 32 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-30 00:32:35,578 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-30 00:32:35,617 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-30 00:32:35,659 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:32:35,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-30 00:32:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:32:35,663 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-30 00:32:35,665 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-30 00:32:35,713 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-30 00:32:35,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-30 00:32:35,733 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;@116c46ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:32:35,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-30 00:32:35,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:35,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:35,972 INFO L139 ounterexampleChecker]: Examining path program with hash -1898477862, occurence #1 [2025-01-30 00:32:35,973 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:35,973 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:35,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 379514131, now seen corresponding path program 1 times [2025-01-30 00:32:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771929907] [2025-01-30 00:32:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:32:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:36,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:36,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:32:36,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:36,261 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-30 00:32:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771929907] [2025-01-30 00:32:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771929907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-30 00:32:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742628785] [2025-01-30 00:32:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-30 00:32:36,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:36,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-30 00:32:36,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-30 00:32:36,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,286 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-30 00:32:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:36,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-30 00:32:36,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:36,505 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:36,505 INFO L139 ounterexampleChecker]: Examining path program with hash 1554231115, occurence #1 [2025-01-30 00:32:36,505 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:36,505 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:36,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1681674933, now seen corresponding path program 2 times [2025-01-30 00:32:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265059868] [2025-01-30 00:32:36,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:32:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:36,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:36,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:36,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:32:36,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:36,662 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-30 00:32:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265059868] [2025-01-30 00:32:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265059868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:36,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:32:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527784215] [2025-01-30 00:32:36,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:36,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 00:32:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:36,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 00:32:36,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-30 00:32:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,664 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:36,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-30 00:32:36,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:36,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:36,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-30 00:32:36,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:36,918 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:36,918 INFO L139 ounterexampleChecker]: Examining path program with hash 1633088055, occurence #1 [2025-01-30 00:32:36,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:36,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:36,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash -834561571, now seen corresponding path program 3 times [2025-01-30 00:32:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595061807] [2025-01-30 00:32:36,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:32:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:36,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:36,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:36,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-30 00:32:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:36,947 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-30 00:32:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595061807] [2025-01-30 00:32:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595061807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:32:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767069857] [2025-01-30 00:32:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:36,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-30 00:32:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:36,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-30 00:32:36,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-30 00:32:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,949 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-30 00:32:36,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:36,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:36,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:36,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-30 00:32:36,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:36,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:36,972 INFO L139 ounterexampleChecker]: Examining path program with hash 997547974, occurence #1 [2025-01-30 00:32:36,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:36,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 317420543, now seen corresponding path program 4 times [2025-01-30 00:32:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:36,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67908276] [2025-01-30 00:32:36,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:32:36,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:36,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-30 00:32:36,983 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:36,984 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-30 00:32:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:37,074 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-30 00:32:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67908276] [2025-01-30 00:32:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67908276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-30 00:32:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734955327] [2025-01-30 00:32:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:37,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-30 00:32:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:37,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-30 00:32:37,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-30 00:32:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:37,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 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-30 00:32:37,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-30 00:32:37,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:37,241 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:37,241 INFO L139 ounterexampleChecker]: Examining path program with hash -420428663, occurence #1 [2025-01-30 00:32:37,241 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:37,242 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 101514785, now seen corresponding path program 5 times [2025-01-30 00:32:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94692585] [2025-01-30 00:32:37,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:32:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:37,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:37,249 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:37,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:32:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:37,302 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-30 00:32:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94692585] [2025-01-30 00:32:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94692585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-30 00:32:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888301887] [2025-01-30 00:32:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:37,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-30 00:32:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:37,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-30 00:32:37,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-30 00:32:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-30 00:32:37,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-30 00:32:37,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:37,417 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:37,417 INFO L139 ounterexampleChecker]: Examining path program with hash -1777587129, occurence #1 [2025-01-30 00:32:37,417 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:37,417 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:37,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1877800737, now seen corresponding path program 6 times [2025-01-30 00:32:37,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:37,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446830325] [2025-01-30 00:32:37,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:32:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:37,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:37,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:37,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-30 00:32:37,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:37,433 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-30 00:32:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446830325] [2025-01-30 00:32:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446830325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:37,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:37,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:32:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392360810] [2025-01-30 00:32:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:37,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-30 00:32:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:37,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-30 00:32:37,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-30 00:32:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,435 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:37,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-30 00:32:37,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-30 00:32:37,528 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:32:37,528 INFO L139 ounterexampleChecker]: Examining path program with hash -1321237228, occurence #1 [2025-01-30 00:32:37,528 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:32:37,528 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:32:37,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:32:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -348489787, now seen corresponding path program 7 times [2025-01-30 00:32:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:32:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773596404] [2025-01-30 00:32:37,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 00:32:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:32:37,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:32:37,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:32:37,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:32:37,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:32:37,627 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-30 00:32:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:32:37,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773596404] [2025-01-30 00:32:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773596404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:32:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:32:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:32:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487903677] [2025-01-30 00:32:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:32:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 00:32:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:32:37,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 00:32:37,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-30 00:32:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:32:37,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:32:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 00:32:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 00:32:37,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-01-30 00:32:37,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-30 00:32:37,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-30 00:32:37,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-30 00:32:37,849 INFO L422 BasicCegarLoop]: Path program histogram: [7] [2025-01-30 00:32:37,850 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-30 00:32:37,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-30 00:32:37,860 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-30 00:32:37,861 INFO L201 PluginConnector]: Adding new model bakery-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:32:37 BasicIcfg [2025-01-30 00:32:37,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-30 00:32:37,862 INFO L158 Benchmark]: Toolchain (without parser) took 2543.77ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 100.4MB in the beginning and 91.4MB in the end (delta: 9.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.0GB. [2025-01-30 00:32:37,862 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:32:37,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:32:37,862 INFO L158 Benchmark]: Boogie Preprocessor took 13.16ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 98.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:32:37,862 INFO L158 Benchmark]: RCFGBuilder took 202.37ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 89.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-30 00:32:37,862 INFO L158 Benchmark]: TraceAbstraction took 2301.91ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 89.0MB in the beginning and 91.4MB in the end (delta: -2.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.0GB. [2025-01-30 00:32:37,863 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.24ms. Allocated memory is still 167.8MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 22.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 13.16ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 98.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 202.37ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 89.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 2301.91ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 89.0MB in the beginning and 91.4MB in the end (delta: -2.5MB). Peak memory consumption was 31.3MB. 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: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1081, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 286, dependent conditional: 259, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1081, independent: 795, independent conditional: 6, independent unconditional: 789, dependent: 286, dependent conditional: 78, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1081, independent: 795, independent conditional: 6, independent unconditional: 789, dependent: 286, dependent conditional: 78, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, independent: 344, independent conditional: 2, independent unconditional: 342, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 749, independent: 143, independent conditional: 18, independent unconditional: 125, dependent: 607, dependent conditional: 271, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1081, independent: 451, independent conditional: 4, independent unconditional: 447, dependent: 234, dependent conditional: 53, dependent unconditional: 181, unknown: 396, unknown conditional: 27, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 344, Positive conditional cache size: 2, Positive unconditional cache size: 342, Negative cache size: 52, Negative conditional cache size: 25, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 628, Maximal queried relation: 7, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 110, Number of trivial persistent sets: 76, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 876, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 81, dependent conditional: 54, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1081, independent: 795, independent conditional: 453, independent unconditional: 342, dependent: 286, dependent conditional: 259, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1081, independent: 795, independent conditional: 6, independent unconditional: 789, dependent: 286, dependent conditional: 78, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1081, independent: 795, independent conditional: 6, independent unconditional: 789, dependent: 286, dependent conditional: 78, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, independent: 344, independent conditional: 2, independent unconditional: 342, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 52, dependent conditional: 25, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 749, independent: 143, independent conditional: 18, independent unconditional: 125, dependent: 607, dependent conditional: 271, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1081, independent: 451, independent conditional: 4, independent unconditional: 447, dependent: 234, dependent conditional: 53, dependent unconditional: 181, unknown: 396, unknown conditional: 27, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 344, Positive conditional cache size: 2, Positive unconditional cache size: 342, Negative cache size: 52, Negative conditional cache size: 25, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 628, Maximal queried relation: 7, Independence queries for same thread: 0 - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 56 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 1.3s, 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: 42, 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, 0.6s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-30 00:32:37,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...