/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/chl/word-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:32,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:32,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:32,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:32,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:32,756 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:32,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:32,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:32,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:32,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:32,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:32,773 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:32,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:32,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:32,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:32,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:32,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:32,775 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:32,775 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:32,775 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:33,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:33,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:33,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:33,021 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:33,023 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:33,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl [2025-04-26 18:40:33,026 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl' [2025-04-26 18:40:33,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:33,052 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:33,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:33,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:33,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:33,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,093 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:33,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:33,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:33,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:33,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:33,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:33,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:33,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:33,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:33,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/1) ... [2025-04-26 18:40:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:33,158 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:33,161 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:33,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:33,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:33,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:33,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:33,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:33,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:33,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:33,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:33,186 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:33,232 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:33,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:33,382 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:33,383 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:33,432 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:33,432 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:33,433 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:33 BoogieIcfgContainer [2025-04-26 18:40:33,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:33,433 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:33,433 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:33,437 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:33,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:33,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:33" (1/2) ... [2025-04-26 18:40:33,439 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fb0e770 and model type word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:33, skipping insertion in model container [2025-04-26 18:40:33,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:33,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:33" (2/2) ... [2025-04-26 18:40:33,440 INFO L376 chiAutomizerObserver]: Analyzing ICFG word-subst.wvr.bpl [2025-04-26 18:40:33,498 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:33,538 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:33,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:33,542 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:33,543 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:33,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 18:40:33,621 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 18:40:33,627 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:33,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:40:33,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 18:40:33,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:33,636 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:33,637 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:33,658 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (in total 376), 109 states have internal predecessors, (376), 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:33,659 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (in total 376), 109 states have internal predecessors, (376), 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:33,662 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:33,708 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209#[thread1EXIT, L123, thread2EXIT, L98]true [2025-04-26 18:40:33,718 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229#[L124, thread2EXIT, L98]true [2025-04-26 18:40:33,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81#[L122, thread1EXIT, L68]true [2025-04-26 18:40:33,720 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 165#[thread1EXIT, L123, L68, L98]true [2025-04-26 18:40:33,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[thread1EXIT, L123, L68, thread3EXIT]true [2025-04-26 18:40:33,722 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[L124, L98, L68]true [2025-04-26 18:40:33,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43#[L38, L121]true [2025-04-26 18:40:33,724 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 65#[L122, L38, L68]true [2025-04-26 18:40:33,724 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69#[L122, L81, L38]true [2025-04-26 18:40:33,725 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103#[L122, thread2EXIT, L38]true [2025-04-26 18:40:33,726 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193#[L98, L123, thread2EXIT, L38]true [2025-04-26 18:40:33,727 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 151#[L98, L123, L81, L38]true [2025-04-26 18:40:33,730 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 197#[L123, L81, thread3EXIT, L38]true [2025-04-26 18:40:33,732 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 143#[L98, L123, L68, L38]true [2025-04-26 18:40:33,734 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[L123, L68, thread3EXIT, L38]true [2025-04-26 18:40:33,734 WARN L140 AmpleReduction]: Number of pruned transitions: 60 [2025-04-26 18:40:33,734 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 15 [2025-04-26 18:40:33,734 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 15 [2025-04-26 18:40:33,734 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:33,734 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:43 [2025-04-26 18:40:33,734 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:33,734 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:33,734 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:33,735 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (in total 113), 59 states have internal predecessors, (113), 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:33,740 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:33,740 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:33,740 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:33,740 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:33,740 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:33,740 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:33,740 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:33,740 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:33,742 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (in total 113), 59 states have internal predecessors, (113), 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:33,755 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 18:40:33,755 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:33,755 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:33,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:33,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:33,759 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:33,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (in total 113), 59 states have internal predecessors, (113), 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:33,761 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 18:40:33,761 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:33,761 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:33,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:33,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:33,765 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_23) (= v_count_4_9 v_count_1_9) (= v_i_9_24 0)) InVars {count_4=v_count_4_9, count_1=v_count_1_9} OutVars{break_10=v_break_10_23, count_1=v_count_1_9, count_4=v_count_4_9, i_9=v_i_9_24} AuxVars[] AssignedVars[break_10, i_9]" [2025-04-26 18:40:33,765 INFO L754 eck$LassoCheckResult]: Loop: "[120] L38-->L38: Formula: (let ((.cse0 (not v_break_10_18)) (.cse3 (select v_get_3_9 v_i_9_19)) (.cse2 (select v_get_0_9 v_i_9_19))) (and (< v_i_9_19 v_len_2_9) .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (or (not .cse1) v_break_10_18) v_break_10_17) (and (not v_break_10_17) .cse0 .cse1))) (< v_i_9_19 v_len_5_9) (= v_result_11_17 (ite (< .cse2 .cse3) (- 1) (ite (< .cse3 .cse2) 1 v_result_11_18))) (= (+ v_i_9_19 1) v_i_9_18))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, get_0=v_get_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_19, get_3=v_get_3_9} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, get_0=v_get_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_18, get_3=v_get_3_9} AuxVars[] AssignedVars[break_10, result_11, i_9]" [2025-04-26 18:40:33,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 5201, now seen corresponding path program 1 times [2025-04-26 18:40:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:33,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290625494] [2025-04-26 18:40:33,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:33,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:33,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:33,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:33,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:33,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2025-04-26 18:40:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:33,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79151179] [2025-04-26 18:40:33,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:33,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:33,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:33,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:33,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:33,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:33,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 161351, now seen corresponding path program 1 times [2025-04-26 18:40:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:33,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633877604] [2025-04-26 18:40:33,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:33,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:33,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:33,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:33,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:33,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:33,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:33,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:33,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:34,205 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:34,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:34,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:34,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:34,206 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:34,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:34,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:34,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:34,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:34,207 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:34,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:34,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:34,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:34,570 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:34,573 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:34,577 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:34,579 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:34,580 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:34,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:34,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:34,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:34,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:34,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:34,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:34,602 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:34,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:34,611 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:34,611 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:34,612 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:34,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:34,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:34,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:34,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:34,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:34,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:34,629 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:34,635 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:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:34,638 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:34,639 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:34,640 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:34,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:34,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:34,651 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:34,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:34,673 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:34,674 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:34,702 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:34,708 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:34,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:34,710 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:34,712 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:34,713 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:34,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:34,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:34,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:34,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:34,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:34,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:34,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:34,743 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:34,743 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:34,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:34,768 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:34,771 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:34,771 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:34,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:34,789 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:34,790 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:34,790 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_9) = 1*len_5 - 1*i_9 Supporting invariants [] [2025-04-26 18:40:34,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:34,799 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:34,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:34,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:34,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:34,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:34,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:34,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:34,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:34,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:34,853 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:34,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:34,869 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (in total 113), 59 states have internal predecessors, (113), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,946 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (in total 113), 59 states have internal predecessors, (113), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 180 states and 375 transitions. Complement of second has 5 states. [2025-04-26 18:40:34,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 18:40:34,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:34,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:34,959 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:34,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:34,959 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:34,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:34,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 375 transitions. [2025-04-26 18:40:34,970 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 18:40:34,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 98 states and 215 transitions. [2025-04-26 18:40:34,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-04-26 18:40:34,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-04-26 18:40:34,977 INFO L74 IsDeterministic]: Start isDeterministic. Operand 98 states and 215 transitions. [2025-04-26 18:40:34,978 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:34,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 215 transitions. [2025-04-26 18:40:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 215 transitions. [2025-04-26 18:40:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2025-04-26 18:40:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.442622950819672) internal successors, (in total 149), 60 states have internal predecessors, (149), 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:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 149 transitions. [2025-04-26 18:40:34,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 149 transitions. [2025-04-26 18:40:34,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 61 states and 149 transitions. [2025-04-26 18:40:34,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:34,997 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 149 transitions. [2025-04-26 18:40:34,998 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:34,998 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:34,998 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:34,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:34,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:34,998 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_23) (= v_count_4_9 v_count_1_9) (= v_i_9_24 0)) InVars {count_4=v_count_4_9, count_1=v_count_1_9} OutVars{break_10=v_break_10_23, count_1=v_count_1_9, count_4=v_count_4_9, i_9=v_i_9_24} AuxVars[] AssignedVars[break_10, i_9]" "[136] L121-->$Ultimate##0: 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]" "[121] $Ultimate##0-->L68: Formula: (and (= v_i_12_10 0) (not v_break_13_9) (= v_count_1_11 v_count_7_7)) InVars {count_7=v_count_7_7, count_1=v_count_1_11} OutVars{i_12=v_i_12_10, count_7=v_count_7_7, count_1=v_count_1_11, break_13=v_break_13_9} AuxVars[] AssignedVars[i_12, break_13]" [2025-04-26 18:40:34,998 INFO L754 eck$LassoCheckResult]: Loop: "[124] L68-->L68: Formula: (let ((.cse2 (select v_get_6_9 v_i_12_23)) (.cse3 (select v_get_0_15 v_i_12_23)) (.cse1 (not v_break_13_22))) (and (let ((.cse0 (= .cse2 .cse3))) (or (and .cse0 (not v_break_13_21) .cse1) (and (or v_break_13_22 (not .cse0)) v_break_13_21))) (= (+ v_i_12_23 1) v_i_12_22) (< v_i_12_23 v_len_8_9) (= v_result_14_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_14_18))) .cse1 (< v_i_12_23 v_len_2_13))) InVars {get_0=v_get_0_15, result_14=v_result_14_18, len_2=v_len_2_13, i_12=v_i_12_23, break_13=v_break_13_22, get_6=v_get_6_9, len_8=v_len_8_9} OutVars{get_0=v_get_0_15, result_14=v_result_14_17, len_2=v_len_2_13, i_12=v_i_12_22, break_13=v_break_13_21, get_6=v_get_6_9, len_8=v_len_8_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 18:40:34,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:34,999 INFO L85 PathProgramCache]: Analyzing trace with hash 5002498, now seen corresponding path program 1 times [2025-04-26 18:40:34,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:34,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074720976] [2025-04-26 18:40:34,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:35,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:35,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:35,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:35,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash 155, now seen corresponding path program 1 times [2025-04-26 18:40:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:35,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016809703] [2025-04-26 18:40:35,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:35,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:35,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:35,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:35,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:35,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:35,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 155077562, now seen corresponding path program 1 times [2025-04-26 18:40:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:35,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077901528] [2025-04-26 18:40:35,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:35,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:35,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:35,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:35,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:35,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:35,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:35,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:35,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:35,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:35,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:35,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:35,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:35,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:35,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:35,406 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:35,541 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:35,541 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:35,545 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:35,545 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:35,547 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:35,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:35,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:35,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:35,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:35,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:35,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:35,564 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:35,570 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:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:35,572 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:35,574 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:35,575 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:35,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:35,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:35,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:35,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:35,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:35,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:35,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:35,595 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:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:35,598 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:35,600 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:35,601 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:35,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:35,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:35,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:35,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:35,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:35,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:35,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:35,620 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 18:40:35,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:35,622 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:35,624 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:35,625 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:35,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:35,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:35,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:35,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:35,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:35,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:35,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:35,652 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:35,652 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:35,655 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:35,656 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:35,665 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:35,683 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:35,683 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:35,683 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:35,683 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_12, len_8) = -1*i_12 + 1*len_8 Supporting invariants [] [2025-04-26 18:40:35,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:35,690 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:35,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:35,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:35,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:35,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:35,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:35,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:35,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:35,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:35,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:35,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:35,720 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:35,721 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:35,721 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 149 transitions. cyclomatic complexity: 109 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:35,767 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 149 transitions. cyclomatic complexity: 109. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 184 states and 449 transitions. Complement of second has 4 states. [2025-04-26 18:40:35,767 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 18:40:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 18:40:35,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:35,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:35,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:35,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:35,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:35,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:35,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 449 transitions. [2025-04-26 18:40:35,773 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:35,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 114 states and 275 transitions. [2025-04-26 18:40:35,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-04-26 18:40:35,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 18:40:35,775 INFO L74 IsDeterministic]: Start isDeterministic. Operand 114 states and 275 transitions. [2025-04-26 18:40:35,775 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:35,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 275 transitions. [2025-04-26 18:40:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 275 transitions. [2025-04-26 18:40:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2025-04-26 18:40:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 2.6266666666666665) internal successors, (in total 197), 74 states have internal predecessors, (197), 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:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 197 transitions. [2025-04-26 18:40:35,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 197 transitions. [2025-04-26 18:40:35,782 INFO L438 stractBuchiCegarLoop]: Abstraction has 75 states and 197 transitions. [2025-04-26 18:40:35,782 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:35,782 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 197 transitions. [2025-04-26 18:40:35,784 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2025-04-26 18:40:35,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:35,784 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:35,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:35,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:35,785 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_23) (= v_count_4_9 v_count_1_9) (= v_i_9_24 0)) InVars {count_4=v_count_4_9, count_1=v_count_1_9} OutVars{break_10=v_break_10_23, count_1=v_count_1_9, count_4=v_count_4_9, i_9=v_i_9_24} AuxVars[] AssignedVars[break_10, i_9]" "[136] L121-->$Ultimate##0: 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]" "[121] $Ultimate##0-->L68: Formula: (and (= v_i_12_10 0) (not v_break_13_9) (= v_count_1_11 v_count_7_7)) InVars {count_7=v_count_7_7, count_1=v_count_1_11} OutVars{i_12=v_i_12_10, count_7=v_count_7_7, count_1=v_count_1_11, break_13=v_break_13_9} AuxVars[] AssignedVars[i_12, break_13]" "[139] L122-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[126] $Ultimate##0-->L98: Formula: (and (= v_i_15_10 0) (not v_break_16_9) (= v_count_7_11 v_count_4_11)) InVars {count_7=v_count_7_11, count_4=v_count_4_11} OutVars{count_7=v_count_7_11, i_15=v_i_15_10, count_4=v_count_4_11, break_16=v_break_16_9} AuxVars[] AssignedVars[i_15, break_16]" [2025-04-26 18:40:35,785 INFO L754 eck$LassoCheckResult]: Loop: "[129] L98-->L98: Formula: (let ((.cse1 (not v_break_16_22)) (.cse3 (select v_get_6_15 v_i_15_23)) (.cse2 (select v_get_3_15 v_i_15_23))) (and (< v_i_15_23 v_len_5_13) (= (+ v_i_15_23 1) v_i_15_22) (< v_i_15_23 v_len_8_13) (let ((.cse0 (= .cse2 .cse3))) (or (and (or v_break_16_22 (not .cse0)) v_break_16_21) (and .cse0 .cse1 (not v_break_16_21)))) .cse1 (= v_result_17_17 (ite (< .cse2 .cse3) (- 1) (ite (< .cse3 .cse2) 1 v_result_17_18))))) InVars {i_15=v_i_15_23, result_17=v_result_17_18, len_5=v_len_5_13, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_22, get_3=v_get_3_15} OutVars{i_15=v_i_15_22, result_17=v_result_17_17, len_5=v_len_5_13, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_21, get_3=v_get_3_15} AuxVars[] AssignedVars[i_15, result_17, break_16]" [2025-04-26 18:40:35,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 512437717, now seen corresponding path program 1 times [2025-04-26 18:40:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:35,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519804857] [2025-04-26 18:40:35,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:35,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:35,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:35,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2025-04-26 18:40:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:35,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543900103] [2025-04-26 18:40:35,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:35,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:35,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:35,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:35,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:35,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1294299828, now seen corresponding path program 1 times [2025-04-26 18:40:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:35,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848016532] [2025-04-26 18:40:35,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:35,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:35,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:35,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:36,029 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:36,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:36,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:36,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:36,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:36,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:36,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:36,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:36,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:36,029 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:36,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:36,244 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:36,374 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:36,374 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:36,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,376 INFO L229 MonitoredProcess]: Starting monitored process 13 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:36,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:40:36,383 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:36,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,396 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:40:36,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,403 INFO L229 MonitoredProcess]: Starting monitored process 14 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:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:40:36,404 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:36,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:40:36,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,426 INFO L229 MonitoredProcess]: Starting monitored process 15 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:36,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:40:36,427 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:36,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,440 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,448 INFO L229 MonitoredProcess]: Starting monitored process 16 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:36,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:40:36,450 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:36,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,465 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,473 INFO L229 MonitoredProcess]: Starting monitored process 17 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:36,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:40:36,510 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:36,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,527 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:40:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,543 INFO L229 MonitoredProcess]: Starting monitored process 18 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:36,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:40:36,545 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:36,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,559 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:40:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,566 INFO L229 MonitoredProcess]: Starting monitored process 19 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:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:40:36,569 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:36,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,582 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,590 INFO L229 MonitoredProcess]: Starting monitored process 20 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:36,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:40:36,592 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:36,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,605 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:36,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:40:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,612 INFO L229 MonitoredProcess]: Starting monitored process 21 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:36,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:40:36,614 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:36,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:36,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:36,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:36,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:36,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:36,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:36,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:36,634 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:40:36,634 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:36,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,637 INFO L229 MonitoredProcess]: Starting monitored process 22 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:36,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:40:36,639 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:36,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:36,655 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:36,655 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:36,655 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_8, i_15) = 1*len_8 - 1*i_15 Supporting invariants [] [2025-04-26 18:40:36,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:40:36,662 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:36,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:36,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:36,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:36,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:36,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:36,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:36,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:36,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:36,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:36,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:36,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:36,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:36,697 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:36,697 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:36,697 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 197 transitions. cyclomatic complexity: 144 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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:36,733 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 197 transitions. cyclomatic complexity: 144. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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 151 states and 392 transitions. Complement of second has 4 states. [2025-04-26 18:40:36,734 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 18:40:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-26 18:40:36,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:36,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:36,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:36,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:36,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:36,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:36,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 392 transitions. [2025-04-26 18:40:36,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:36,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:36,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:36,737 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:36,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:36,737 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:36,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:36,737 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:36,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:36,748 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:36 BoogieIcfgContainer [2025-04-26 18:40:36,748 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:36,749 INFO L158 Benchmark]: Toolchain (without parser) took 3697.07ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.2MB in the beginning and 66.2MB in the end (delta: 20.0MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:36,749 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:36,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.87ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:36,750 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:36,750 INFO L158 Benchmark]: RCFGBuilder took 303.82ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 68.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 18:40:36,750 INFO L158 Benchmark]: BuchiAutomizer took 3314.98ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:36,752 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.78ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.87ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 303.82ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 68.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 3314.98ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 76 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 19 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital105 mio100 ax100 hnf100 lsp188 ukn42 mio100 lsp77 div100 bol107 ite100 ukn100 eq155 hnf100 smp100 dnf534 smp10 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 1 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 205, Number of transitions in reduction automaton: 113, Number of states in reduction automaton: 60, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_9 + len_5 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_12 + len_8 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_15 + len_8 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 18:40:36,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...