/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/weaver-benchmarks/generated/parallel/misc-2-unrolled.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:39,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:39,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:39,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:39,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:39,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:39,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:39,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:39,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:39,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:39,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:39,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:39,263 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:39,263 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:39,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:39,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:39,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:39,265 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:39,266 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:39,266 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:39,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:39,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:39,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:39,519 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:39,519 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:39,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-2-unrolled.wvr.bpl [2025-04-26 18:40:39,522 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-2-unrolled.wvr.bpl' [2025-04-26 18:40:39,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:39,539 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:39,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:39,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:39,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,578 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:39,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:39,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:39,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:39,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:39,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:39,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,633 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 18:40:39,635 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 18:40:39,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:39,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:39,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:39,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:39,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:39,660 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 18:40:39,694 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:39,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:39,777 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:39,777 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:39,788 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:39,788 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:39,789 INFO L201 PluginConnector]: Adding new model misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:39 BoogieIcfgContainer [2025-04-26 18:40:39,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:39,789 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:39,789 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:39,795 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:39,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:39,795 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/2) ... [2025-04-26 18:40:39,796 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42a0eb88 and model type misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:39, skipping insertion in model container [2025-04-26 18:40:39,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:39,796 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:39" (2/2) ... [2025-04-26 18:40:39,797 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-2-unrolled.wvr.bpl [2025-04-26 18:40:39,845 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:39,889 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:39,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,892 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 18:40:39,894 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 18:40:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:40:39,975 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 18:40:39,977 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:39,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:40:39,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:40:39,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 18:40:39,987 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 18:40:39,988 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2025-04-26 18:40:40,006 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (in total 133), 69 states have internal predecessors, (133), 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 18:40:40,007 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (in total 133), 69 states have internal predecessors, (133), 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 18:40:40,009 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:40,081 WARN L140 AmpleReduction]: Number of pruned transitions: 43 [2025-04-26 18:40:40,082 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:40,082 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 9 [2025-04-26 18:40:40,082 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:21 [2025-04-26 18:40:40,082 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:39 [2025-04-26 18:40:40,082 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 18:40:40,082 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:14 [2025-04-26 18:40:40,082 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:40,083 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 70 states, 68 states have (on average 1.3235294117647058) internal successors, (in total 90), 69 states have internal predecessors, (90), 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 18:40:40,089 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:40,089 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:40,089 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:40,089 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:40,089 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:40,089 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:40,090 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:40,090 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:40,093 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 68 states have (on average 1.3235294117647058) internal successors, (in total 90), 69 states have internal predecessors, (90), 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 18:40:40,102 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2025-04-26 18:40:40,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,105 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:40,106 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 68 states have (on average 1.3235294117647058) internal successors, (in total 90), 69 states have internal predecessors, (90), 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 18:40:40,107 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2025-04-26 18:40:40,108 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,108 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,113 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L40: Formula: (and (= v_i1_7 v_pos_9) (= v_i2_7 v_pos_9) (= v_pos_9 0)) InVars {i1=v_i1_7, pos=v_pos_9, i2=v_i2_7} OutVars{i1=v_i1_7, pos=v_pos_9, i2=v_i2_7} AuxVars[] AssignedVars[]" "[68] L40-->L17: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:40,113 INFO L754 eck$LassoCheckResult]: Loop: "[53] L17-->L18: Formula: (< v_i1_1 (* 2 v_N_1)) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[55] L18-->L19: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[56] L19-->L20: Formula: (= v_i1_2 (+ v_i1_3 1)) InVars {i1=v_i1_3} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1]" "[57] L20-->L21: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[58] L21-->L17: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" [2025-04-26 18:40:40,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2455, now seen corresponding path program 1 times [2025-04-26 18:40:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193489380] [2025-04-26 18:40:40,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 79269910, now seen corresponding path program 1 times [2025-04-26 18:40:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995428713] [2025-04-26 18:40:40,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1615729728, now seen corresponding path program 1 times [2025-04-26 18:40:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358141441] [2025-04-26 18:40:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:40,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:40,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:40,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,369 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:40,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:40,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:40,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:40,370 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:40,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:40,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:40,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-2-unrolled.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:40,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:40,371 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:40,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,452 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:40,452 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:40,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,455 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 18:40:40,456 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 18:40:40,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:40,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:40,477 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 18:40:40,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,479 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 18:40:40,480 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 18:40:40,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:40,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:40,557 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:40,562 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 18:40:40,562 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:40,562 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:40,562 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:40,562 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:40,562 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:40,562 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,562 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:40,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:40,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-2-unrolled.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:40,563 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:40,563 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:40,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,634 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:40,637 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:40,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,641 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 18:40:40,643 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 18:40:40,647 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 18:40:40,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:40,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:40,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:40,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:40,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:40,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:40,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:40,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:40,674 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:40,674 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,677 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 18:40:40,679 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 18:40:40,680 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:40,683 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:40:40,683 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 18:40:40,684 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:40,684 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:40,684 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 2*N Supporting invariants [] [2025-04-26 18:40:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:40,693 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:40,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:40,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:40,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,808 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 18:40:40,828 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:40:40,830 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 70 states, 68 states have (on average 1.3235294117647058) internal successors, (in total 90), 69 states have internal predecessors, (90), 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 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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 18:40:40,899 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 70 states, 68 states have (on average 1.3235294117647058) internal successors, (in total 90), 69 states have internal predecessors, (90), 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 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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 138 states and 181 transitions. Complement of second has 7 states. [2025-04-26 18:40:40,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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 18:40:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-04-26 18:40:40,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 5 letters. [2025-04-26 18:40:40,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 18:40:40,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 10 letters. [2025-04-26 18:40:40,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 181 transitions. [2025-04-26 18:40:40,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:40:40,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 67 states and 86 transitions. [2025-04-26 18:40:40,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-04-26 18:40:40,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-04-26 18:40:40,921 INFO L74 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2025-04-26 18:40:40,921 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:40,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-04-26 18:40:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2025-04-26 18:40:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2025-04-26 18:40:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.296875) internal successors, (in total 83), 63 states have internal predecessors, (83), 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 18:40:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2025-04-26 18:40:40,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 83 transitions. [2025-04-26 18:40:40,942 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2025-04-26 18:40:40,942 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:40,942 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2025-04-26 18:40:40,943 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:40:40,943 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,943 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,944 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L40: Formula: (and (= v_i1_7 v_pos_9) (= v_i2_7 v_pos_9) (= v_pos_9 0)) InVars {i1=v_i1_7, pos=v_pos_9, i2=v_i2_7} OutVars{i1=v_i1_7, pos=v_pos_9, i2=v_i2_7} AuxVars[] AssignedVars[]" "[68] L40-->L17: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] L17-->thread1FINAL: Formula: (<= (* 2 v_N_2) v_i1_6) InVars {i1=v_i1_6, N=v_N_2} OutVars{i1=v_i1_6, N=v_N_2} AuxVars[] AssignedVars[]" "[54] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[71] L40-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:40:40,944 INFO L754 eck$LassoCheckResult]: Loop: "[60] L28-->L29: Formula: (< v_i2_4 (* 2 v_N_4)) InVars {i2=v_i2_4, N=v_N_4} OutVars{i2=v_i2_4, N=v_N_4} AuxVars[] AssignedVars[]" "[62] L29-->L30: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[63] L30-->L31: Formula: (= (+ v_i2_6 1) v_i2_5) InVars {i2=v_i2_6} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[i2]" "[64] L31-->L32: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[65] L32-->L28: Formula: (= v_i2_1 (+ v_i2_2 1)) InVars {i2=v_i2_2} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" [2025-04-26 18:40:40,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash 73188622, now seen corresponding path program 1 times [2025-04-26 18:40:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370740059] [2025-04-26 18:40:40,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 85950045, now seen corresponding path program 1 times [2025-04-26 18:40:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232047167] [2025-04-26 18:40:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1692083856, now seen corresponding path program 1 times [2025-04-26 18:40:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620940952] [2025-04-26 18:40:40,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:40,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:40,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,033 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 18:40:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:41,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620940952] [2025-04-26 18:40:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620940952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:41,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048992762] [2025-04-26 18:40:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:41,073 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,074 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:41,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-2-unrolled.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,074 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,109 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,109 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:41,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,113 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 18:40:41,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,116 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 18:40:41,127 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:41,128 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:41,134 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 18:40:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,136 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 18:40:41,136 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 18:40:41,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:40:41,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,159 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 18:40:41,161 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 18:40:41,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:41,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,239 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:41,243 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 18:40:41,244 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:41,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-2-unrolled.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,244 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,279 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,280 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:41,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,281 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 18:40:41,283 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 18:40:41,283 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 18:40:41,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,296 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:41,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:41,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,304 INFO L229 MonitoredProcess]: Starting monitored process 11 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 18:40:41,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:40:41,307 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 18:40:41,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:41,322 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:41,322 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:41,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,324 INFO L229 MonitoredProcess]: Starting monitored process 12 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 18:40:41,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:40:41,327 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:41,330 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:40:41,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:40:41,331 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:41,331 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:41,331 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 2*N Supporting invariants [] [2025-04-26 18:40:41,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:41,338 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:41,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:41,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:41,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:41,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,425 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 18:40:41,425 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:40:41,425 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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 18:40:41,468 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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 126 states and 165 transitions. Complement of second has 6 states. [2025-04-26 18:40:41,471 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 18:40:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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 18:40:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 18:40:41,471 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 5 letters. [2025-04-26 18:40:41,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 18:40:41,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 10 letters. [2025-04-26 18:40:41,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 165 transitions. [2025-04-26 18:40:41,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:41,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 0 states and 0 transitions. [2025-04-26 18:40:41,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:41,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:41,474 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:41,474 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:41,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:41,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:41,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:41,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:41,478 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:40:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:41,479 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:40:41,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:40:41,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:41,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:40:41,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:41,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:41,479 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:41,480 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:41,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:41,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:41,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:40:41,480 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:41,480 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:41,480 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:41,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:41,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:41,490 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 18:40:41,491 INFO L201 PluginConnector]: Adding new model misc-2-unrolled.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:41 BoogieIcfgContainer [2025-04-26 18:40:41,491 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:41,492 INFO L158 Benchmark]: Toolchain (without parser) took 1952.67ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.1MB in the beginning and 61.3MB in the end (delta: 24.8MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,492 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.68ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,493 INFO L158 Benchmark]: Boogie Preprocessor took 23.40ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 921.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,493 INFO L158 Benchmark]: RCFGBuilder took 184.25ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,493 INFO L158 Benchmark]: BuchiAutomizer took 1702.20ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 61.3MB in the end (delta: 12.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,495 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.76ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.68ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.40ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 921.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 184.25ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1702.20ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 61.3MB in the end (delta: 12.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 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, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 33 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 198, Number of transitions in reduction automaton: 90, Number of states in reduction automaton: 70, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + 2 * N and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these 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 18:40:41,512 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...