/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/popl20-more/min-le-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:16,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:16,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:16,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:16,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:16,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:16,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:16,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:16,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:16,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:16,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:16,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:16,329 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:16,329 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:16,329 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:16,329 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:16,330 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:16,330 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:16,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:16,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:16,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:16,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:16,332 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:16,332 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:16,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:16,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:16,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:16,577 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:16,577 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:16,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl [2025-04-26 18:41:16,579 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl' [2025-04-26 18:41:16,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:16,598 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:16,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:16,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:16,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:16,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,633 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:16,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:16,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:16,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:16,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:16,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:16,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:16,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:16,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:16,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/1) ... [2025-04-26 18:41:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:16,682 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:41:16,684 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:41:16,703 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:16,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:16,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:16,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:16,705 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:41:16,742 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:16,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:16,825 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:16,825 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:16,836 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:16,836 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:16,837 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:16 BoogieIcfgContainer [2025-04-26 18:41:16,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:16,838 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:16,838 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:16,843 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:16,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:16,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:16" (1/2) ... [2025-04-26 18:41:16,844 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@303deb96 and model type min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:16, skipping insertion in model container [2025-04-26 18:41:16,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:16,845 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:16" (2/2) ... [2025-04-26 18:41:16,845 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-le-max.wvr.bpl [2025-04-26 18:41:16,900 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:16,945 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:16,949 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:41:16,951 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:41:16,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 79 flow [2025-04-26 18:41:17,011 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 18:41:17,013 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:17,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 2/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:41:17,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 79 flow [2025-04-26 18:41:17,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 23 transitions, 64 flow [2025-04-26 18:41:17,021 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 23 transitions, 64 flow [2025-04-26 18:41:17,022 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 23 transitions, 64 flow [2025-04-26 18:41:17,044 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 130 states, 128 states have (on average 2.6328125) internal successors, (in total 337), 129 states have internal predecessors, (337), 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:41:17,045 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 130 states, 128 states have (on average 2.6328125) internal successors, (in total 337), 129 states have internal predecessors, (337), 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:41:17,049 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:17,117 WARN L140 AmpleReduction]: Number of pruned transitions: 96 [2025-04-26 18:41:17,117 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:17,118 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 14 [2025-04-26 18:41:17,118 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:41:17,118 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:65 [2025-04-26 18:41:17,118 WARN L145 AmpleReduction]: Times succ was already a loop node:13 [2025-04-26 18:41:17,118 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:21 [2025-04-26 18:41:17,118 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:17,119 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 107 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 106 states have internal predecessors, (162), 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:41:17,124 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:17,124 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:17,124 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:17,124 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:17,124 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:17,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:17,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:17,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:17,127 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 106 states have internal predecessors, (162), 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:41:17,140 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 73 [2025-04-26 18:41:17,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:17,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:17,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:17,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:17,144 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:17,144 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 106 states have internal predecessors, (162), 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:41:17,148 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 73 [2025-04-26 18:41:17,148 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:17,148 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:17,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:17,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:17,151 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} OutVars{A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} AuxVars[] AssignedVars[]" "[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:17,151 INFO L754 eck$LassoCheckResult]: Loop: "[53] L20-->L21: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[55] L21-->L22: Formula: (= (let ((.cse0 (select v_A_1 v_i_2))) (ite (< v_min_2 .cse0) v_min_2 .cse0)) v_min_1) InVars {A=v_A_1, i=v_i_2, min=v_min_2} OutVars{A=v_A_1, i=v_i_2, min=v_min_1} AuxVars[] AssignedVars[min]" "[56] L22-->L20: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:17,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2484, now seen corresponding path program 1 times [2025-04-26 18:41:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:17,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55010067] [2025-04-26 18:41:17,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:17,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:17,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:17,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:17,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:17,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash 82485, now seen corresponding path program 1 times [2025-04-26 18:41:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:17,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288796499] [2025-04-26 18:41:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:17,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:17,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:17,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:17,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash 74053538, now seen corresponding path program 1 times [2025-04-26 18:41:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:17,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432892431] [2025-04-26 18:41:17,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:17,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:17,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:17,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:17,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:17,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:17,466 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:17,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:17,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:17,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:17,466 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:17,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:17,467 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:17,467 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:17,467 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:17,467 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:17,467 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:17,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:17,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:17,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:17,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:17,709 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:17,712 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:17,716 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:41:17,718 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:41:17,720 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:41:17,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:17,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:17,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:17,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:17,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:17,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:17,743 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:17,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:41:17,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:17,751 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:41:17,752 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:41:17,752 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:41:17,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:17,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:17,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:17,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:17,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:17,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:17,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:17,776 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:41:17,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:17,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:17,779 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:41:17,780 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:41:17,782 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:41:17,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:17,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:17,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:17,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:17,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:17,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:17,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:17,808 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:17,808 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:17,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:17,825 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:41:17,827 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:41:17,828 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:17,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:17,844 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:17,845 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:17,845 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:17,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:17,859 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:17,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:17,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:17,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:17,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:17,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:17,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:17,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:17,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:17,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:17,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:17,926 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:41:17,944 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:17,946 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 107 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 106 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:18,022 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 107 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 106 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 229 states and 366 transitions. Complement of second has 7 states. [2025-04-26 18:41:18,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-26 18:41:18,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:41:18,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:41:18,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:41:18,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 366 transitions. [2025-04-26 18:41:18,037 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 18:41:18,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 82 states and 127 transitions. [2025-04-26 18:41:18,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-04-26 18:41:18,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 18:41:18,046 INFO L74 IsDeterministic]: Start isDeterministic. Operand 82 states and 127 transitions. [2025-04-26 18:41:18,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:18,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-04-26 18:41:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 127 transitions. [2025-04-26 18:41:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2025-04-26 18:41:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.554054054054054) internal successors, (in total 115), 73 states have internal predecessors, (115), 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:41:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-04-26 18:41:18,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-04-26 18:41:18,067 INFO L438 stractBuchiCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-04-26 18:41:18,067 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:18,068 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 115 transitions. [2025-04-26 18:41:18,069 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 18:41:18,073 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:18,074 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:18,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:41:18,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:18,074 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} OutVars{A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} AuxVars[] AssignedVars[]" "[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[53] L20-->L21: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[69] L45-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:18,074 INFO L754 eck$LassoCheckResult]: Loop: "[58] L29-->L30: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[60] L30-->L31: Formula: (= (let ((.cse0 (select v_A_2 v_j_2))) (ite (< .cse0 v_max_2) v_max_2 .cse0)) v_max_1) InVars {A=v_A_2, max=v_max_2, j=v_j_2} OutVars{A=v_A_2, max=v_max_1, j=v_j_2} AuxVars[] AssignedVars[max]" "[61] L31-->L29: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 18:41:18,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2388836, now seen corresponding path program 1 times [2025-04-26 18:41:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:18,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315860405] [2025-04-26 18:41:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:18,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:18,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:18,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:18,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-04-26 18:41:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:18,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393105548] [2025-04-26 18:41:18,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:18,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:18,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:18,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:18,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:18,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:18,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:18,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1848573097, now seen corresponding path program 1 times [2025-04-26 18:41:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:18,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713108771] [2025-04-26 18:41:18,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:18,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:18,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:18,204 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:18,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:18,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:18,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:18,205 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:18,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:18,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:18,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:18,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:18,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:18,205 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:18,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:18,355 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:18,356 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:18,358 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:41:18,359 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:41:18,360 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:41:18,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:18,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:18,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:18,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:18,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:18,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:18,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:18,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:18,382 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:41:18,382 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:41:18,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:41:18,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:18,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:18,394 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:18,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:18,401 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:18,401 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:18,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:18,420 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:41:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:18,422 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:41:18,424 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:41:18,425 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:41:18,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:18,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:18,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:18,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:18,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:18,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:18,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:18,456 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:18,456 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:18,459 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:41:18,461 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:41:18,462 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:18,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:18,479 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:18,479 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:18,479 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, j) = 1*N - 1*j Supporting invariants [] [2025-04-26 18:41:18,485 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:41:18,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:18,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:18,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:18,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:18,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:18,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:18,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:18,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:18,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:18,543 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:41:18,544 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:18,544 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 115 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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:41:18,582 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 115 transitions. cyclomatic complexity: 56. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 157 states and 245 transitions. Complement of second has 6 states. [2025-04-26 18:41:18,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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:41:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-04-26 18:41:18,585 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:41:18,585 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,585 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:41:18,585 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,585 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:41:18,585 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:18,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 245 transitions. [2025-04-26 18:41:18,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:18,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 0 states and 0 transitions. [2025-04-26 18:41:18,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:18,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:18,587 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:18,587 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:18,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:18,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:18,587 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:18,588 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:18,588 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:18,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:18,588 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:18,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:18,598 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:18 BoogieIcfgContainer [2025-04-26 18:41:18,598 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:18,599 INFO L158 Benchmark]: Toolchain (without parser) took 2001.47ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.3MB in the beginning and 37.8MB in the end (delta: 47.5MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2025-04-26 18:41:18,599 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.75ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:18,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.90ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:18,600 INFO L158 Benchmark]: Boogie Preprocessor took 21.86ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:18,600 INFO L158 Benchmark]: RCFGBuilder took 179.42ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:18,600 INFO L158 Benchmark]: BuchiAutomizer took 1760.29ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 37.8MB in the end (delta: 35.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:18,601 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.75ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.90ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.86ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 179.42ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1760.29ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 37.8MB in the end (delta: 35.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. 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 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 21 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp116 ukn58 mio100 lsp65 div100 bol100 ite100 ukn100 eq174 hnf93 smp100 dnf145 smp65 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 178, Number of transitions in reduction automaton: 162, Number of states in reduction automaton: 107, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:18,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...