/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/gemcutter/Termination.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:52:36,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:37,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:37,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:37,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:37,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:37,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:37,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:37,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:37,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:37,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:37,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:37,047 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:37,047 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:37,047 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:37,047 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:37,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:37,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:37,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:37,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:37,049 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:37,049 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:37,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:37,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:37,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:37,341 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:37,343 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:37,344 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:52:37,345 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/MirabelleConcurrentIncrement.bpl' [2025-04-26 16:52:37,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:37,363 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:37,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:37,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:37,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:37,373 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:52:37" (1/1) ... [2025-04-26 16:52:37,401 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:52:37" (1/1) ... [2025-04-26 16:52:37,406 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:37,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:37,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:37,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:37,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:37,414 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:52:37" (1/1) ... [2025-04-26 16:52:37,414 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:52:37" (1/1) ... [2025-04-26 16:52:37,414 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:52:37" (1/1) ... [2025-04-26 16:52:37,415 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:52:37" (1/1) ... [2025-04-26 16:52:37,416 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:52:37" (1/1) ... [2025-04-26 16:52:37,416 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:52:37" (1/1) ... [2025-04-26 16:52:37,421 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:52:37" (1/1) ... [2025-04-26 16:52:37,422 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:52:37" (1/1) ... [2025-04-26 16:52:37,422 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:52:37" (1/1) ... [2025-04-26 16:52:37,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:37,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:37,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:37,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:37,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:37" (1/1) ... [2025-04-26 16:52:37,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:37,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:37,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:52:37,494 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:37,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:37,494 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T1 given in one single declaration [2025-04-26 16:52:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure T1 [2025-04-26 16:52:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure T1 [2025-04-26 16:52:37,495 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2025-04-26 16:52:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2025-04-26 16:52:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2025-04-26 16:52:37,496 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:52:37,530 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:37,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:37,591 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:37,592 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:37,601 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:37,601 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:52:37,602 INFO L201 PluginConnector]: Adding new model MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:37 BoogieIcfgContainer [2025-04-26 16:52:37,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:37,602 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:37,602 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:37,609 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:37,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:37,609 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:37" (1/2) ... [2025-04-26 16:52:37,611 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ac7c6f7 and model type MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:37, skipping insertion in model container [2025-04-26 16:52:37,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:37,612 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:52:37" (2/2) ... [2025-04-26 16:52:37,613 INFO L376 chiAutomizerObserver]: Analyzing ICFG MirabelleConcurrentIncrement.bpl [2025-04-26 16:52:37,652 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:52:37,696 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:37,699 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-26 16:52:37,702 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-26 16:52:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 64 flow [2025-04-26 16:52:37,765 INFO L116 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-04-26 16:52:37,766 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:52:37,771 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:52:37,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 64 flow [2025-04-26 16:52:37,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 54 flow [2025-04-26 16:52:37,775 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 18 transitions, 54 flow [2025-04-26 16:52:37,780 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:37,822 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:52:37,822 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:52:37,822 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 16:52:37,822 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:14 [2025-04-26 16:52:37,822 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 16:52:37,822 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 16:52:37,822 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:37,822 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:37,824 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 27 states, 25 states have (on average 1.4) internal successors, (in total 35), 26 states have internal predecessors, (35), 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:52:37,829 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:37,829 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:37,829 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:37,829 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:37,829 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:37,829 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:37,830 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:37,830 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:37,835 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 25 states have (on average 1.4) internal successors, (in total 35), 26 states have internal predecessors, (35), 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:52:37,843 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-04-26 16:52:37,845 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:37,845 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:37,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:37,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:52:37,849 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:37,849 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 25 states have (on average 1.4) internal successors, (in total 35), 26 states have internal predecessors, (35), 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:52:37,852 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-04-26 16:52:37,852 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:37,852 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:37,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:37,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:52:37,856 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:52:37,856 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:52:37,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1970, now seen corresponding path program 1 times [2025-04-26 16:52:37,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:37,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368671304] [2025-04-26 16:52:37,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:37,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:37,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:37,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:37,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:37,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:37,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:52:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:37,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283150998] [2025-04-26 16:52:37,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:37,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:37,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:37,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:37,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1894420, now seen corresponding path program 1 times [2025-04-26 16:52:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:37,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38466479] [2025-04-26 16:52:37,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:37,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:37,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:37,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:37,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:37,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:37,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:37,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:37,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:37,992 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:37,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:37,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:37,993 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:37,993 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:52:37,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:37,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:37,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:37,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration1_Loop [2025-04-26 16:52:37,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:37,993 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:38,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:38,048 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:38,048 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:52:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,051 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:52:38,053 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:52:38,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:52:38,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:38,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:52:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,081 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:52:38,083 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:52:38,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:52:38,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:38,160 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:52:38,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:52:38,165 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:38,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:38,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:38,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:38,165 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:38,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:38,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:38,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration1_Loop [2025-04-26 16:52:38,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:38,165 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:38,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:38,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:38,199 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,202 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:52:38,204 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:52:38,205 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:52:38,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:38,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:38,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:38,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:38,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:38,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:38,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:38,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:38,235 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:52:38,235 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:52:38,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,238 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:52:38,241 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:52:38,242 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:38,245 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:52:38,246 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:52:38,246 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:38,247 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x) = 1*n - 1*x Supporting invariants [] [2025-04-26 16:52:38,254 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:52:38,257 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:38,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:38,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:38,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:38,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:38,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:38,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:38,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:38,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:38,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:38,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:38,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:38,328 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:52:38,362 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:52:38,364 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 25 states have (on average 1.4) internal successors, (in total 35), 26 states have internal predecessors, (35), 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) 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:52:38,468 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 25 states have (on average 1.4) internal successors, (in total 35), 26 states have internal predecessors, (35), 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). 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 52 states and 70 transitions. Complement of second has 6 states. [2025-04-26 16:52:38,469 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:52:38,472 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:52:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 16:52:38,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:52:38,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:52:38,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:52:38,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 70 transitions. [2025-04-26 16:52:38,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:52:38,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 19 states and 28 transitions. [2025-04-26 16:52:38,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-04-26 16:52:38,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 16:52:38,482 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2025-04-26 16:52:38,482 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:52:38,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-04-26 16:52:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2025-04-26 16:52:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-04-26 16:52:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (in total 27), 17 states have internal predecessors, (27), 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:52:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2025-04-26 16:52:38,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2025-04-26 16:52:38,496 INFO L438 stractBuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2025-04-26 16:52:38,496 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:38,496 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2025-04-26 16:52:38,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:52:38,496 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:38,496 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:38,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:38,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:52:38,497 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]" "[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[]" "[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:52:38,497 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:52:38,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1894430, now seen corresponding path program 1 times [2025-04-26 16:52:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:38,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464214404] [2025-04-26 16:52:38,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:38,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:38,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:38,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:38,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2025-04-26 16:52:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:38,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319812788] [2025-04-26 16:52:38,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:38,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:38,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:38,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:38,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:38,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:38,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1820548608, now seen corresponding path program 1 times [2025-04-26 16:52:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:38,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974713330] [2025-04-26 16:52:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:52:38,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:52:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:38,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:52:38,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:52:38,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:38,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:38,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:38,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:38,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:38,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:38,531 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:52:38,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:38,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:38,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration2_Loop [2025-04-26 16:52:38,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:38,531 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:38,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:38,561 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:38,561 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:52:38,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,563 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:52:38,565 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:52:38,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:52:38,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:38,582 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:52:38,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,584 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:52:38,585 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:52:38,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:52:38,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:38,649 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:52:38,653 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:52:38,654 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:38,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:38,654 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:38,654 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:38,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:38,654 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:38,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:38,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: MirabelleConcurrentIncrement.bpl_petrified1_Iteration2_Loop [2025-04-26 16:52:38,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:38,654 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:38,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:38,672 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:38,672 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:38,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,674 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:52:38,675 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:52:38,676 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:52:38,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:38,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:38,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:38,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:38,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:38,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:38,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:38,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:38,693 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:52:38,693 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:52:38,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:38,695 INFO L229 MonitoredProcess]: Starting monitored process 10 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:52:38,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:52:38,697 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:38,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:38,701 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:52:38,701 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:38,701 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, y) = 1*n - 1*y Supporting invariants [] [2025-04-26 16:52:38,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:38,708 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:38,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:38,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:38,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:38,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:38,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:38,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:38,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:38,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:38,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:38,745 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:52:38,745 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:52:38,745 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:52:38,763 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 30 states and 43 transitions. Complement of second has 4 states. [2025-04-26 16:52:38,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:52:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:52:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:52:38,764 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:52:38,764 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,764 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:52:38,764 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,764 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:52:38,764 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:38,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2025-04-26 16:52:38,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:38,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:52:38,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:52:38,765 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:38,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:38,765 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:52:38,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:38,766 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:52:38,775 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-26 16:52:38,777 INFO L201 PluginConnector]: Adding new model MirabelleConcurrentIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:52:38 BoogieIcfgContainer [2025-04-26 16:52:38,777 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:52:38,777 INFO L158 Benchmark]: Toolchain (without parser) took 1414.42ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.0MB in the beginning and 87.6MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:38,778 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:38,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:38,778 INFO L158 Benchmark]: Boogie Preprocessor took 26.55ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 967.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:38,778 INFO L158 Benchmark]: RCFGBuilder took 165.80ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:38,778 INFO L158 Benchmark]: BuchiAutomizer took 1174.51ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.4MB in the beginning and 87.6MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:38,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.55ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 967.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.80ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1174.51ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.4MB in the beginning and 87.6MB in the end (delta: -13.2MB). 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.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 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, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 12 mSDtfsCounter, 44 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: 47ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 132, Number of transitions in reduction automaton: 35, Number of states in reduction automaton: 27, Underlying: - 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 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:52:38,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...