/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/MirabelleConcurrentIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:15,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:15,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:15,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:15,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:15,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:15,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:15,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:15,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:15,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:15,428 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:15,428 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:15,428 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:15,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:15,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:15,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:15,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:15,432 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:15,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:15,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:15,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:15,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:15,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:15,432 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:15,432 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:15,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:15,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:15,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:15,659 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:15,661 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:15,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/MirabelleConcurrentIncrement.bpl [2025-04-26 16:20:15,663 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/MirabelleConcurrentIncrement.bpl' [2025-04-26 16:20:15,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:15,680 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:15,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:15,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:15,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:15,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,716 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:15,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:15,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:15,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:15,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:15,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:15,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:15,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:15,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:15,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/1) ... [2025-04-26 16:20:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:15,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:15,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:15,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:15,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T1 given in one single declaration [2025-04-26 16:20:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure T1 [2025-04-26 16:20:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure T1 [2025-04-26 16:20:15,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2025-04-26 16:20:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2025-04-26 16:20:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2025-04-26 16:20:15,806 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:15,838 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:15,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:15,908 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:15,908 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:15,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:15,917 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:15,917 INFO L201 PluginConnector]: Adding new model MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:15 BoogieIcfgContainer [2025-04-26 16:20:15,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:15,918 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:15,918 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:15,922 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:15,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:15,922 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:15" (1/2) ... [2025-04-26 16:20:15,923 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31c22e87 and model type MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:15, skipping insertion in model container [2025-04-26 16:20:15,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:15,923 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:15" (2/2) ... [2025-04-26 16:20:15,924 INFO L376 chiAutomizerObserver]: Analyzing ICFG MirabelleConcurrentIncrement.bpl [2025-04-26 16:20:15,963 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:20:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 64 flow [2025-04-26 16:20:16,019 INFO L116 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-04-26 16:20:16,020 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:20:16,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 18 events. 3/18 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-26 16:20:16,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 64 flow [2025-04-26 16:20:16,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 54 flow [2025-04-26 16:20:16,028 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 18 transitions, 54 flow [2025-04-26 16:20:16,036 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:16,036 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:16,036 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:16,037 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:16,037 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:16,038 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:16,038 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:16,038 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:16,040 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:16,062 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:16,062 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:16,062 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:16,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:16,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:16,070 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:16,070 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2025-04-26 16:20:16,072 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:16,072 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:16,072 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:16,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:16,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:16,076 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_y_1 v_x_1) InVars {y=v_y_1, x=v_x_1} OutVars{y=v_y_1, x=v_x_1} AuxVars[] AssignedVars[]" "[48] L18-->L31: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:20:16,077 INFO L754 eck$LassoCheckResult]: Loop: "[39] L31-->L32: Formula: (< v_x_4 v_n_1) InVars {x=v_x_4, n=v_n_1} OutVars{x=v_x_4, n=v_n_1} AuxVars[] AssignedVars[]" "[41] L32-->L31: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:16,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1970, now seen corresponding path program 1 times [2025-04-26 16:20:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626970656] [2025-04-26 16:20:16,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:20:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681381905] [2025-04-26 16:20:16,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1894420, now seen corresponding path program 1 times [2025-04-26 16:20:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989212777] [2025-04-26 16:20:16,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,214 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:16,215 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:16,215 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:16,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:16,216 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:16,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:16,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:16,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:16,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:16,216 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:16,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:16,270 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:16,272 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:16,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:16,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:16,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:16,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:16,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:16,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:16,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:16,383 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:16,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:16,388 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:16,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:16,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:16,388 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:16,388 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:16,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:16,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:16,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:16,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:16,388 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:16,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:16,414 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:16,417 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:16,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:16,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:16,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:16,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:16,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:16,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:16,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:16,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:16,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:16,446 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:16,447 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:16,452 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:16,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:16,455 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:16,456 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:16,456 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x) = 1*n - 1*x Supporting invariants [] [2025-04-26 16:20:16,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:16,465 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:16,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:16,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:16,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:16,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:16,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:16,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:16,534 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-26 16:20:16,610 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:16,616 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:16,752 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 86 states and 184 transitions. Complement of second has 6 states. [2025-04-26 16:20:16,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:20:16,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:16,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:16,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:16,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:16,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:16,766 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:16,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 184 transitions. [2025-04-26 16:20:16,769 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:20:16,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 30 states and 66 transitions. [2025-04-26 16:20:16,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:20:16,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-04-26 16:20:16,773 INFO L74 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2025-04-26 16:20:16,773 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:16,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2025-04-26 16:20:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2025-04-26 16:20:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-04-26 16:20:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (in total 54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 54 transitions. [2025-04-26 16:20:16,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 54 transitions. [2025-04-26 16:20:16,789 INFO L438 stractBuchiCegarLoop]: Abstraction has 24 states and 54 transitions. [2025-04-26 16:20:16,789 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:16,789 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 54 transitions. [2025-04-26 16:20:16,790 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:20:16,790 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:16,790 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:16,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:20:16,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:16,791 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_y_1 v_x_1) InVars {y=v_y_1, x=v_x_1} OutVars{y=v_y_1, x=v_x_1} AuxVars[] AssignedVars[]" "[48] L18-->L31: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T1Thread1of1ForFork0_thidvar0]" "[51] L18-1-->L39: Formula: (= v_T2Thread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{T2Thread1of1ForFork1_thidvar0=v_T2Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork1_thidvar0]" [2025-04-26 16:20:16,791 INFO L754 eck$LassoCheckResult]: Loop: "[43] L39-->L40: Formula: (< v_y_4 v_n_3) InVars {y=v_y_4, n=v_n_3} OutVars{y=v_y_4, n=v_n_3} AuxVars[] AssignedVars[]" "[45] L40-->L39: Formula: (= (+ v_y_6 1) v_y_5) InVars {y=v_y_6} OutVars{y=v_y_5} AuxVars[] AssignedVars[y]" [2025-04-26 16:20:16,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 61121, now seen corresponding path program 1 times [2025-04-26 16:20:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491605958] [2025-04-26 16:20:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:16,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:16,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2025-04-26 16:20:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943000934] [2025-04-26 16:20:16,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:16,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:16,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 58738659, now seen corresponding path program 1 times [2025-04-26 16:20:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:16,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362366763] [2025-04-26 16:20:16,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:16,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:16,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:16,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:16,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:16,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:16,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:16,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:16,825 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:16,826 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:16,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:16,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:16,826 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:16,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:16,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:16,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:16,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:16,826 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:16,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:16,848 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:16,848 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:16,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:16,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:16,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:16,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:20:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:16,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:16,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:16,941 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:16,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:20:16,946 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:16,946 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:16,946 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:16,946 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:16,946 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:16,946 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,946 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:16,946 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:16,946 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:16,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:16,946 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:16,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:16,965 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:16,965 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:16,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:16,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:16,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:16,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:16,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:16,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:16,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:16,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:16,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:16,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:16,988 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:16,988 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:16,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:16,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:16,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:16,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:16,993 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:16,996 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:16,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:20:16,997 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:16,997 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:16,997 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, y) = 1*n - 1*y Supporting invariants [] [2025-04-26 16:20:17,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:17,004 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:17,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:17,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:17,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:17,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:17,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:17,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:17,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:17,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:17,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:17,044 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-26 16:20:17,045 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:17,045 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 54 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:17,083 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 54 transitions. cyclomatic complexity: 37. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 61 states and 132 transitions. Complement of second has 6 states. [2025-04-26 16:20:17,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 16:20:17,084 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:20:17,084 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:17,084 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:20:17,084 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:17,084 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:20:17,084 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:17,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 132 transitions. [2025-04-26 16:20:17,086 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:17,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:17,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:17,086 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:17,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:17,086 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:17,086 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:17,086 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:17,091 INFO L201 PluginConnector]: Adding new model MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:17 BoogieIcfgContainer [2025-04-26 16:20:17,091 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:17,092 INFO L158 Benchmark]: Toolchain (without parser) took 1412.54ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 82.7MB in the beginning and 78.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:17,092 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:17,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.89ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:17,093 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.9MB in the end (delta: 868.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:17,093 INFO L158 Benchmark]: RCFGBuilder took 169.97ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 71.3MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:17,093 INFO L158 Benchmark]: BuchiAutomizer took 1173.66ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.2MB in the beginning and 78.8MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:17,094 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.25ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.89ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.9MB in the end (delta: 868.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 169.97ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 71.3MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1173.66ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.2MB in the beginning and 78.8MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 16 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + n and consists of 4 locations. One deterministic module has affine ranking function n + -1 * y and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:17,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...