/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/test/easy1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 12:44:56,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 12:44:56,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 12:44:56,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 12:44:56,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 12:44:56,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 12:44:56,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 12:44:56,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 12:44:56,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 12:44:56,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 12:44:56,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 12:44:56,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 12:44:56,613 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 12:44:56,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 12:44:56,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 12:44:56,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 12:44:56,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 12:44:56,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 12:44:56,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:44:56,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:56,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:56,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 12:44:56,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 12:44:56,618 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 12:44:56,618 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 12:44:56,618 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-04-25 12:44:56,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 12:44:56,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 12:44:56,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 12:44:56,879 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 12:44:56,880 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 12:44:56,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy1.wvr.bpl [2025-04-25 12:44:56,882 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy1.wvr.bpl' [2025-04-25 12:44:56,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 12:44:56,902 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 12:44:56,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 12:44:56,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 12:44:56,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 12:44:56,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,931 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 12:44:56,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 12:44:56,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 12:44:56,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 12:44:56,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 12:44:56,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 12:44:56,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 12:44:56,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 12:44:56,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 12:44:56,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/1) ... [2025-04-25 12:44:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:56,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:56,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 12:44:56,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 12:44:57,003 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 12:44:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 12:44:57,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 12:44:57,003 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 12:44:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 12:44:57,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 12:44:57,003 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 12:44:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 12:44:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 12:44:57,004 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 12:44:57,033 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 12:44:57,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 12:44:57,099 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 12:44:57,099 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 12:44:57,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 12:44:57,109 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 12:44:57,110 INFO L201 PluginConnector]: Adding new model easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:44:57 BoogieIcfgContainer [2025-04-25 12:44:57,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 12:44:57,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 12:44:57,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 12:44:57,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 12:44:57,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:56" (1/2) ... [2025-04-25 12:44:57,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7077ae61 and model type easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:44:57, skipping insertion in model container [2025-04-25 12:44:57,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:44:57" (2/2) ... [2025-04-25 12:44:57,118 INFO L128 eAbstractionObserver]: Analyzing ICFG easy1.wvr.bpl [2025-04-25 12:44:57,129 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 12:44:57,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG easy1.wvr.bpl that has 3 procedures, 18 locations, 17 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-25 12:44:57,132 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 12:44:57,167 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 12:44:57,204 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:44:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 12:44:57,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:57,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 12:44:57,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 12:44:57,243 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 12:44:57,261 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 12:44:57,267 INFO L340 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;@41386ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:44:57,267 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 12:44:57,304 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:57,304 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:57,304 INFO L139 ounterexampleChecker]: Examining path program with hash 1394000362, occurence #1 [2025-04-25 12:44:57,304 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:57,304 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:57,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -197836653, now seen corresponding path program 1 times [2025-04-25 12:44:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:57,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386876656] [2025-04-25 12:44:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:57,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-25 12:44:57,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-25 12:44:57,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:57,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:57,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386876656] [2025-04-25 12:44:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386876656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:57,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:44:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92869981] [2025-04-25 12:44:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:57,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:44:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:57,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:44:57,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:44:57,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,470 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:57,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-04-25 12:44:57,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 12:44:57,509 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:57,509 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:57,509 INFO L139 ounterexampleChecker]: Examining path program with hash 366674143, occurence #1 [2025-04-25 12:44:57,509 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:57,509 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:57,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash -234376847, now seen corresponding path program 1 times [2025-04-25 12:44:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:57,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266927436] [2025-04-25 12:44:57,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:57,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-25 12:44:57,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-25 12:44:57,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:57,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:57,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266927436] [2025-04-25 12:44:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266927436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 12:44:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360420697] [2025-04-25 12:44:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:57,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 12:44:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:57,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 12:44:57,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 12:44:57,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,606 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:57,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-04-25 12:44:57,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 12:44:57,687 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:57,687 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:57,687 INFO L139 ounterexampleChecker]: Examining path program with hash 2105271559, occurence #1 [2025-04-25 12:44:57,687 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:57,687 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:57,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1684473017, now seen corresponding path program 1 times [2025-04-25 12:44:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:57,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755678813] [2025-04-25 12:44:57,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-25 12:44:57,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-25 12:44:57,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:57,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:57,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755678813] [2025-04-25 12:44:57,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755678813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:57,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:57,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 12:44:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878641973] [2025-04-25 12:44:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:57,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 12:44:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:57,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 12:44:57,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 12:44:57,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,729 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:57,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-04-25 12:44:57,729 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,729 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,729 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 12:44:57,802 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:57,802 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:57,802 INFO L139 ounterexampleChecker]: Examining path program with hash -1035015737, occurence #1 [2025-04-25 12:44:57,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:57,802 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:57,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1858850903, now seen corresponding path program 1 times [2025-04-25 12:44:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:57,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965740628] [2025-04-25 12:44:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:57,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 12:44:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 12:44:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:57,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965740628] [2025-04-25 12:44:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965740628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:57,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-25 12:44:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687220181] [2025-04-25 12:44:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:57,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 12:44:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:57,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 12:44:57,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-25 12:44:57,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,926 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:57,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-04-25 12:44:57,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:57,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:57,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:57,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 12:44:57,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 12:44:57,984 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:57,984 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:57,984 INFO L139 ounterexampleChecker]: Examining path program with hash -2062341956, occurence #1 [2025-04-25 12:44:57,984 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:57,984 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:57,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 557408309, now seen corresponding path program 2 times [2025-04-25 12:44:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:57,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612070528] [2025-04-25 12:44:57,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 12:44:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:57,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-25 12:44:57,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 12:44:57,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 12:44:57,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:44:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:58,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612070528] [2025-04-25 12:44:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612070528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 12:44:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756073378] [2025-04-25 12:44:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:58,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 12:44:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:58,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 12:44:58,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 12:44:58,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:58,039 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:58,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-04-25 12:44:58,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:58,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:58,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:58,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 12:44:58,039 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:58,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:58,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:58,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:58,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 12:44:58,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:58,093 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-04-25 12:44:58,094 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 12:44:58,094 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 12:44:58,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 12:44:58,098 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-25 12:44:58,100 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 12:44:58,100 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 12:44:58,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 12:44:58,109 INFO L201 PluginConnector]: Adding new model easy1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:44:58 BasicIcfg [2025-04-25 12:44:58,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 12:44:58,110 INFO L158 Benchmark]: Toolchain (without parser) took 1207.49ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 91.3MB in the end (delta: -9.5MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:58,110 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.86ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:58,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.08ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 12:44:58,111 INFO L158 Benchmark]: Boogie Preprocessor took 23.28ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:58,111 INFO L158 Benchmark]: RCFGBuilder took 153.78ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 67.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 12:44:58,111 INFO L158 Benchmark]: TraceAbstraction took 997.13ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 91.3MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:58,112 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 1.86ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.08ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.28ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 153.78ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 67.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 997.13ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 91.3MB in the end (delta: -24.9MB). There was no memory consumed. 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: 306, independent: 245, independent conditional: 120, independent unconditional: 125, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 0, independent unconditional: 245, 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: 245, independent: 245, independent conditional: 0, independent unconditional: 245, 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: 116, independent: 116, independent conditional: 0, independent unconditional: 116, 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: 116, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 245, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 116, unknown conditional: 0, unknown unconditional: 116] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, 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: 120, Maximal queried relation: 0, Independence queries for same thread: 61, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 25, Number of trivial persistent sets: 18, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 125, independent conditional: 0, independent unconditional: 125, 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: 306, independent: 245, independent conditional: 120, independent unconditional: 125, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 120, independent unconditional: 125, 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: 245, independent: 245, independent conditional: 0, independent unconditional: 245, 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: 245, independent: 245, independent conditional: 0, independent unconditional: 245, 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: 116, independent: 116, independent conditional: 0, independent unconditional: 116, 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: 116, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 245, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 116, unknown conditional: 0, unknown unconditional: 116] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, 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: 120, Maximal queried relation: 0, Independence queries for same thread: 61 - PositiveResult [Line: 37]: 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, 28 locations, 31 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.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: 27, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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-04-25 12:44:58,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...